Quiz on Sorting

How many passes does an insertion sort algorithm consist of?

• N

• N-1

• N+2

• 2N

Which of the following algorithm implementations is similar to that of an insertion sort?

• Binary Heap

• Quick sort

• Merge Sort

• Radix Sort

Any algorithm that sorts by exchanging adjacent elements require O(N2) on average.

• True

• False

Binary search can be used in an insertion sort algorithm to reduce the number of comparisons.

• True

• False

Which of the following sorting algorithms is the fastest for sorting small arrays?

• Quick sort

• Insertion sort

• Shell sort

• Heap Sort