A(n) ____ finds the location of the smallest element in the unsorted portion of the list and moves it to the top of the unsorted portion of the list.
A) selection sort algorithm
B) quicksort algorithm
C) insertion sort algorithm
D) bubble sort algorithm

Question

Quizplus · Accepted Answer

The selection sort algorithm repeatedly finds the minimum element from the unsorted segment of the array and places it at the beginning, effectively sorting the array incrementally.

A(n) ____ Finds the Location of the Smallest Element in the Unsorted