CPSC1050 Sorting Algorithm

Which element of the array is sorted (in its final correct position) after the first pass of the insertion sort?

What would the following array look like after the first pass of the bubble sort algorithm (sort in ascending order)?

33, -5, 12, -4, 13, 5, 0, 11, 2, 28

• -5, -4, 33, 12, 13, 5, 0, 2, 11, 28

• -5, 12, -4, 13, 5, 0, 11, 2, 28, 33

• -4, -5, 12, 13, 5, 0, 11, 2, 28, 33

• -5, -4, 0, 2, 5, 11, 12, 13, 28, 33

What would the following array look like after the first pass of the insertion sort algorithm (sort in ascending order)?

33, -5, 12, -7, 17, 5, 0, 11, 2, 28

• 0, -5, 12, -7, 17, 5, 0, 33, 2, 28

• -7, -5, 12, 33, 17, 5, 0, 11, 2, 28

• -5, 33, 12, -7, 17, 5, 0, 11, 2, 28

What would the following array look like after the first swap of the quick sort algorithm if the first item is considered as the pivot (sort in ascending order)?

3, -5, 12, 5, -3, 0, 11, 2, 20

• 3, -5, 2, 5, -3, 0, 11, 12, 20

• 3, -5, 2, 0, -3, 5, 11, 12, 20

• -3, -5, 2, 0, 3, 5, 11, 12, 20

How many comparisons are needed to search for 35 in the following sorted array using Binary Search?

2, 12, 25, 33, 36, 52, 55, 67, 85, 90, 95, 100

• 12

• 3

• 4

• 5

Suppose we are sorting an array of nine integers using quicksort, and we have just finished the first partitioning with the array looking like this:

2  5  1  0  6  9  12  11  10

• The pivot could be either the 6 or the 9.

• The pivot could be the 6, but it is not the 9.

• The pivot is not the 6, but it could be the 9.

• Neither the 6 nor the 9 could be the pivot.