tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 14 - Dr. Sohail Aslam

We will now show that in the average case, quicksort runs in Θ(n log n) time. Recall that when we talked about average case at the beginning of the semester, we said that it depends on some assumption about the distribution of inputs. In this lecture, you find clear explanations of Analysis of quick sort average case. |