Good reference for average-case runtime analysis of QuickSort I'm a beginner in programming with little knowledge about the technicalities. I'm assigned to do a "reading project" on the average case analysis of quicksort. I mean I have to present it in class. Now, I need a good source from which I can read it and find the materials which I can include in my presentation. As for my existing knowledge on algorithms, one can assume that I almost know nothing except for "just codes" and nothing at all about their analysis. Any book or materials having rigorous proofs will also do. Any help will be greatly appreciated!
Given your stats background, you will find the "indicator variable" analysis easier than the solution via recurrence equations.
It is based on computing the probability that two elements of given ranks are compared to each other. 

The idea is described on the wikipedia page
and in more detail in Section 7.4 of Cormen et al. Introduction to Algorithms 3rd edition.