Big O analysis of QuickSort

Question

Using median-of-three pivot for the quicksort implementation determine the running time Big O worst case of quicksort for:

a. sorted input

b. reverse-ordered input

c. random input

Repeat the previous Exercise when the pivot is chosen as:

a. the first element

b. the larger of the first two distinct elements

c. a random element

d. the average of all elements in the set 

Answer 1

C.

A.

B.

C.

C.