The name of the sorting algorithm that locates the smallest unsorted value in an array and places it in the next sorted position of the array is called:
A)bubble sort
B)merge sort
C)radix sort
D)selection sort

Question

Quizplus · Accepted Answer

This algorithm is called selection sort, as it selects the smallest unsorted value and places it in the next sorted position. Bubble sort compares adjacent elements and swaps them if they are in the wrong order. Merge sort divides the array into smaller sub-arrays, sorts them recursively, and then merges them back together. Radix sort sorts elements by their digits, rather than by comparing the elements directly. Therefore, selection sort is the only algorithm that matches the given description.

The Name of the Sorting Algorithm That Locates the Smallest