Sorting Algorithms - Practice Test

(A) The leftmost element is chosen as the pivot

(B) The rightmost element is chosen as the pivot

(C) Any element in the array is chosen as the pivot

(D) A random number is generated which is used as the pivot

(C) Any element in the array is chosen as the pivot

(A) Bubble Sort

(B) Quick Sort

(C) Partition-exchange Sort

(D) Insertion Sort

(D) Insertion Sort

(A) true

(B) false

(A) true

(A) true

(B) false

(A) true

(A) stooge sort

(B) strand sort

(C) quick sort

(D) bubble sort

(A) stooge sort

Sorting Algorithms - Study Mode