The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position. A. True B. False

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if they are not in order relative to each other. A. quick sort B. bubble sort C. insertion sort D. merge sort E. selection sort

The __________________ algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted. A. insertion sort B. merge sort C. bubble sort D. quick sort E. selection sort

In selection sort, after each pass through the array, what is guaranteed about the elements at the beginning of the array?a.They are in reverse orderb.They are randomly rearrangedc.They are sortedd.They remain unchanged

Explain the core principle behind selection sort.

Which of the following algorithm pays the least attention to the ordering of the elements in the input list?Insertion sort Selection sort Quick sort None