Time left $1$:$41$:$36$

Question $6$

Not yet answered

Marked out of $2\mathrm{.}00$

Flag question

Suppose that the splits at every level of quicksort algorithm are in the proportion $\frac{1}{100}$ to $99/100.$

Select one or more:

a$.$ Quicksort runs in $O(Nlo{g}_{\frac{100}{99}}(N))$

b$.$ The maximum depth of a leaf in the recursion tree $($the longest branch$)$ is approximately log$99/100$ N

c$.$ The minimum depth of a leaf in the recursion tree $($the shortest branch$)$ is approximately $lo{g}_{\frac{1}{10}}N$

d$.$ Quicksort does not run in $O(N^2)$