Suppose thqat quicksort always pivot to n/3th smallest element how many comparisons would be made in woest case
Answers
Answered by
1
Let's start by looking at the worst-case running time. Suppose that we're really unlucky and the partition sizes are really unbalanced.
Similar questions
History,
6 months ago
Math,
6 months ago
Computer Science,
11 months ago
English,
11 months ago
Science,
1 year ago