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

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

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 a binary search, the elements of the array must be in which order?Group of answer choicesAll options are correctAscending orderRandom orderDescending order

The pivot element has to be the last element in the array if it is to be sorted using quick sort.Group of answer choicesDepends on the arrayTrueFalse

If you declare an array double[] list = new double[5], the highest index in the array is ________. Group of answer choices012345