Frequently Asked Questions on Selection Sort

How does Selection Sort Algorithm work?

Lets consider the following array as an example: arr[] = {64, 25, 12, 22, 11} First pass: For the first position in the sorted array, the whole array is traversed from index 0 to 4 sequentially. The first position where 64 is stored presently, after traversing whole array it is clear that 11 is the lowest value.Thus, replace 64 with 11. After one iteration 11, which happens to be the least value in the array, tends to appear in the first position of the sorted list.Selection Sort Algorithm | Swapping 1st element with the minimum in arraySecond Pass: For the second position, where 25 is present, again traverse the rest of the array in a sequential manner.After traversing, we found that 12 is the second lowest value in the array and it should appear at the second place in the array, thus swap these values.Selection Sort Algorithm | swapping i=1 with the next minimum elementThird Pass: Now, for third place, where 25 is present again traverse the rest of the array and find the third least value present in the array.While traversing, 22 came out to be the third least value and it should appear at the third place in the array, thus swap 22 with element present at third position.Selection Sort Algorithm | swapping i=2 with the next minimum elementFourth pass: Similarly, for fourth position traverse the rest of the array and find the fourth least element in the array As 25 is the 4th lowest value hence, it will place at the fourth position.Selection Sort Algorithm | swapping i=3 with the next minimum elementFifth Pass: At last the largest value present in the array automatically get placed at the last position in the arrayThe resulted array is the sorted array.Selection Sort Algorithm | Required sorted array...

Complexity Analysis of Selection Sort

Time Complexity: The time complexity of Selection Sort is O(N2) as there are two nested loops:...

Advantages of Selection Sort Algorithm

Simple and easy to understand.Works well with small datasets....

Disadvantages of the Selection Sort Algorithm

Selection sort has a time complexity of O(n^2) in the worst and average case.Does not work well on large datasets.Does not preserve the relative order of items with equal keys which means it is not stable....

Frequently Asked Questions on Selection Sort

Q1. Is Selection Sort Algorithm stable?...