The following is the ____ algorithm
For fill = 0 to n - 2 do
Set posMin to the subscript of the smallest item starting at subscript fill.
Exchange the item at posMin with the one at fill.
A) Heapsort
B) Insertion sort
C) Selection sort
D) Merge sort

Question

Quizplus · Accepted Answer

The described algorithm is the Selection sort algorithm, which repeatedly finds the minimum element from the unsorted part and puts it at the beginning.

The Following Is the ____ Algorithm