Virtual Labs

a: When most of the chosen pivots are the smallest in the subarray b: When most of the chosen pivots are the biggest in the subarray c: When most of the chosen pivots are smaller than some and bigger than some d: a and b

3. Function

quick_sort(array) -> sorted-array:
    if array is empty: return array
    pivot = choose_pivot_index()
    smaller_array = [], bigger_array = []
    for i = 1 to sizeof(array):
        if (-----A-----):
           append array[i] to smaller_array
        else if (-----B-----):
            append array[i] to bigger_array
    return quick_sort(smaller_array) + [array[pivot]] + quick_sort(bigger_array)

Which of the following pairs can be selected simultaneously for blanks (A) and (B) in the quick-sort algorithm, and would cover all edge cases.

a: array[i] < array[pivot] and array[i] >= array[pivot] b: array[i] <= array[pivot] and array[i] > array[pivot] c: array[i] < array[pivot] and array[i] > array[pivot] d: array[i] <= array[pivot] and array[i] >= array[pivot] e: a and b

Quick Sort Experiment