Worst-Case Linear-Time Selection
Thus after partitioning around x, step 5 will call Select() on at most 3n/4 elements
The recurrence is therefore:
???
???
???
???
???
?n/5? ? n/5
Substitute T(n) = cn
Combine fractions
Express in desired form
What we set out to prove
Previous slide
Next slide
Back to first slide
View graphic version