Question

Which sorting algorithm works by iterating through an input array a, and swapping a[i] with a[x], where i starts at 0 and ends at a.length-1, and x is an index of a minimum value found in a[i], a[i+1], ..., a[a.length-1]? Selection Sort Bubble Sort Insertion Sort Bogo Sort Ascending Sort

Answer 1

The answer is Selection sort

example :

arr[] = 50 64 12 21 11

find the minimum element in arr[0...4] and place it in the beginning of arr[0...4]

after 1st pass the array would be : 11 64 12 21 50

find the minimum element in arr[1...4] and place it in the beginning of arr[1...4]

after 2nd pass : 11 12 64 21 50

like this the final array is 11 12 21 50 64