A(n) ____ finds which element belongs in a particular position on each pass through the array and moves it there.
A) selection sort
B) bubble sort
C) insertion sort
D) merge sort

Question

Quizplus · Accepted Answer

Selection sort works by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning. This algorithm maintains two subarrays in a given array: 1) The subarray which is already sorted. 2) Remaining subarray which is unsorted. In every iteration of selection sort, the minimum element from the unsorted subarray is picked and moved to the sorted subarray.

A(n) ____ Finds Which Element Belongs in a Particular Position