Sorting in Java

Under what condition will a selection sort execute faster?

• If the data is already sorted in ascending order

• If the data is already sorted in descending order

• It will always take the same time

Which sort should be the fastest most of the time?

• selection sort

• insertion sort

• mergesort

What would the code return from mystery([90, -30, 50], 50)

• -1

• 50

• 1

• 2

Which of the following correctly shows the iterations of an ascending (from left to right) insertion sort on an array with the following elements: {7,3,8,5,4}?

• {3,7,8,5,4},{3,7,8,5,4},{3,5,7,8,4},{3,4,5,7,8}

• {3,4,8,5,7},{3,4,5,7,8}

• {3,7,8,5,4}{3,5,7,8,4},{3,4,5,7,8}

• {4,7,3,8,5},{4,3,7,8,5},{3,4,5,7,8}

Which of the following correctly shows the iterations of an ascending (from left to right) selection sort on an array with the following elements: {10, 6, 3, 2, 8}?

• {6,10,3,2,8}, {3,6,10,2,8}, {2,3,6,10,8}, {2,3,6,8,10}

• {6,10,3,2,8}, {3,6,10,2,8}, {2,3,6,8,10}

• {2,6,3,10,8}, {2,3,6,10,8}, {2,3,6,8,10}

• {2,6,3,10,8}, {2,3,6,10,8}, {2,3,6,10,8}, {2,3,6,8,10}

Answer correctly

• ["$ bills", "120 dogs", "Tennis", "alien", "ma", "manners"]

• [ "120 dogs", "$ bills",, "Tennis", "alien", "ma", "manners"]

• ["$ bills", "120 dogs", "alien", "ma", "manners", "Tennis"]

• [ "120 dogs", "$ bills", "alien", "ma", "manners", "Tennis"]

• b, p, D, E, y, S

• D, E, b, p, y, S

• E, b, p, E, y, S

• b, p, y, E, D, S

• E, E, S, b, p, y

What would the array look like after the SECOND pass through the sort

• 19, 53, 28, 30, 77, 65

• 28, 53, 77, 30, 19, 65

• 19, 28, 30, 53, 65, 77

• 53, 77, 28, 30, 19, 65

• 19, 28, 53, 30, 77, 65

Which of the following BEST describes a Selection Sort algorithm?

• This sort algorithm will focus on each element in the list and compare it to the elements at previous positions. It will swap the current element with one of the previous elements(if it is less than the current element)

• When using this sort algorithm and sorting array [6, 2, 30, 10, 1], the first pass results in [2, 6, 30, 10, 1]

• This sort algorithm searches the remaining elements in the list for the best element to swap with the current element. Once the pass is completed, if an element is found that is less than the current element, then one swap will be made.

• This sort algorithm will make exactly one swap per pass

• This sort algorithm tends to be an efficient algorithm for lists with many elements