231k views
4 votes
With a 9 to 1 proportional split at every level of recursion, which intuitively seems quite unbalanced, quicksort runs in O(n lg n)O a. FalseO b. TrueO c. This is unbalanced, therefore n^2 runtimeO d. none of the answers is correct

User Sharpling
by
8.5k points

1 Answer

5 votes

Answer:

B

Step-by-step explanation: