Sorting Algorithms

Question 1

Which sorting algorithm makes comparisons and swaps between pairs of elements?

Answer 1

Bubble sort

Question 2

Which example shows bubble sort?

Answer 2

A B C 3 5 4 1 2 -> 3 4 5 1 2 -> 3 4 1 5 2 -> 3 1 4 5 2 -> 1 3 4 5 2 -> 1 2 3 4 5

Question 3

Which example showed bubble sort?

Answer 3

B

Question 4

Which example shows insertion sort?

Answer 4

A B C 3 5 4 1 2 -> 3 5 4 1 2 -> 4 5 1 2 -> 4 1 5 2 -> 1 2 4 5 -> 3 2 4 5 -> 1 2 3 4 5.

Question 5

Which example showed bubble sort?

Answer 5

C

Question 6

Which sorting algorithm is shown here?

Answer 6

Quick sort with the middle element chosen as the pivot.

Question 7

Perform the first pass of bubble sort on the values 4 2 3 5 1.

Answer 7

4 2 3 5 1 -> 2 4 3 5 1 -> 3 2 4 5 1 -> 3 4 2 5 1 -> 1 3 4 5.

Question 8

Which sorting algorithm can be improved by adding a flag to record whether or not a swap has occurred?

Answer 8

Bubble sort.

Question 9

Perform insertion sort on the values 4 2 3 5 1.

Answer 9

Initial: 4 2 3 5 1 -> 2 4 3 5 1 -> 3 2 4 5 1 -> 1 2 3 4 5.

Question 10

Name the two functions in merge sort.

Answer 10

MergeSort and Merge.

Question 11

In which sorting algorithm is the largest element in place after the first pass?

Answer 11

Bubble sort.

Question 12

Which sorting algorithm uses pivots?

Answer 12

Quick sort.

Question 13

Which of our sorting algorithms is the most efficient?

Answer 13

Merge sort.

Question 14

Perform merge sort on the values 4 2 3 5.

Answer 14

Initial: 4 2 3 5 -> 4 2 3 5 -> 2 4 3 5 -> 2 3 4 5.