Quickselect average complexity
What is the average-case time to find the th smallest element of an unsorted array via quickselect?
Show hints (2)+
- Unlike quicksort, you recurse into only one partition.
- The expected work forms a geometric series.
Answer
Reveal answer →Final answer
Create a free account to see the full worked solution and track your progress.
Interview format: Hedge Fund Quant, Systematic & Data-Driven Trading