Question $1$

When all elements of the input array $($of size n$)$ are the same, which of the following is true about Hoare's

Quicksort algorithm?

Hoare's Quicksort will repeatedly divide the input array into two subarrays, one of size $0$ and the other

of size $n.$

Hoare's Quicksort will repeatedly divide the input array into two subarrays of arbitrary sizes.

Hoare's Quicksort will repeatedly divide the input array into two subarrays, one of size $1$ and the other

of size $n-1.$

Hoare's Quicksort will repeatedly divide the input array into two subarrays, each of size n$/2.$

Question $2$

When the input array $($of size $n)$ is already sorted, what is the total number of key comparisons $($KCs$)$ made

in one call to Hoare's partition using the first element as the pivot?

$n+1$

$0$

n

$\frac{n}{2}$