Analyzing Quicksort: Average Case
So T(n) ? an lg n + b for certain a and b
Thus the induction holds
Thus T(n) = O(n lg n)
Thus quicksort runs in O(n lg n) time on average (phew!)
Oh yeah, the summation…
Previous slide
Next slide
Back to first slide
View graphic version