Question

Selection Sort, which works by finding the smallest value in the unsorted part of the collection, and exchanging it with the next unsorted value until the collection is sorted:

int selectionArray = {10, 23, 95, 48, 8};

Using the following format WITH NO SPACES in the entire line, type in what the array looks like for at the end of each pass.

[        ,         ,         ,         ,         ]

Answer 1

Answer:
--------
[8,23,95,48,10]
[8,10,95,48,23]
[8,10,23,48,95]
[8,10,23,48,95]

Explanation:
-------------
Selection sort
Original list is [10, 23, 95, 48, 8]
Iteration: 1
   > Replace element 10 with minimum number of remaining list [10, 23, 95, 48, 8]
   > Minimum element found is 8. so, swap it with element at index 0 which is 10
   > List after iteration 1 is [8, 23, 95, 48, 10]

Iteration: 2
   > Replace element 23 with minimum number of remaining list [23, 95, 48, 10]
   > Minimum element found is 10. so, swap it with element at index 1 which is 23
   > List after iteration 2 is [8, 10, 95, 48, 23]

Iteration: 3
   > Replace element 95 with minimum number of remaining list [95, 48, 23]
   > Minimum element found is 23. so, swap it with element at index 2 which is 95
   > List after iteration 3 is [8, 10, 23, 48, 95]

Iteration: 4
   > Replace element 48 with minimum number of remaining list [48, 95]
   > Minimum element found is 48. so, swap it with element at index 3 which is 48
   > List after iteration 4 is [8, 10, 23, 48, 95]

Sorted list is [8, 10, 23, 48, 95]