Explain the selection sort algorithm?
- 1 Answers
- 1165 Views
- Hexaware, I also Faced
- E-Mail Answers
Answer / Virendra Kumar Shukla
Selection Sort is a simple sorting algorithm that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the sorted part. It has two main steps: selecting the smallest (or largest, depending on whether it's a min or max heap) element and swapping it with the first (or last) element in the unsorted portion. The time complexity is O(n^2).
| Is This Answer Correct ? | 0 Yes | 0 No |
What is string variable?
What are java packages? What is the significance of packages?
Is JRE required to compile Java files ?
What is java beans?
can we override the main() method in java????
3 Answers Vimukti Technologies,
FOR EXAMPLE WE R HAVING TWO LIST ELEMENTS ..BOTH LISTS CONTAINS ID,NAME,PLACE ..I NEED TO COMPARE BOTH IDS IN TWO LISTS,IF ID'S R SAME MEANS WE HAVE ADD THE DETAILS(LIKE NAME,PLACE) TO MAP...HOW IS POSSIBLE ?CAN ANY ONE SUGGEST?
how to fing linkedlist is circular or not?
what is main difference b/w abstract class and interface
What is the protocol is used in type4 driver?
What are controls and their different types in awt?
Why is stringbuffer faster than string?
How many types of equations are there?
Core Java 
