Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot
Let $C_1$ and $C_2$ be the number of comparisons made for the inputs (i) and (ii) respectively. Then,
both are the worst cases of quick sort. (assuming pivot is either first or last element)
Visit exam center at your own risk ...