Sorting Algorithms - Practice Test

(A) pigeonhole sort is a comparison based sort

(B) any comparison based sorting can be made stable

(C) quick sort is not a comparison based sort

(D) any comparison based sort requires at least O(n 2 ) time

(B) any comparison based sorting can be made stable

(A) O(n log n)

(B) O(n 2 )

(C) O(n 2 log n)

(D) O(n log n 2 )

(A) O(n log n)

(A) merge sort

(B) quick sort

(C) heap sort

(D) insertion sort

(A) merge sort

(A) O(n)

(B) O(1)

(C) O(log n)

(D) O(n log n)

(A) O(n)

(A) O(n)

(B) O(log n)

(C) O(1)

(D) O(n 2 )

(C) O(1)

Sorting Algorithms - Study Mode