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

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

1 pointHow does Bubble Sort compare elements in an array? Compares adjacent elements and swaps if they are in the wrong order Compares random elements in the array Compares all elements with the first element Compares elements in reverse order

Which sorting algorithm is based on the principle of repeatedly selecting the minimum element from the unsorted part of the array and placing it in its correct position?Group of answer choicesSelection SortMerge SortBubble SortInsertion Sort

In insertion sort, if an element is smaller than the previous element, what action does the algorithm take?a.Moves the element to the end of the arrayb.Ignores the elementc.Swaps the element with the previous oned.Leaves the element as it is

Using our Selection Sort algorithm, after one pass of the Selection Sort, the smallest element is in its correct place in the array.Group of answer choicesTrueFalse