More on Sorting and Analyzing Run Time Complexity
In the previous entry (Sorting, Random Permutations, and little bit of Probability), we introduced
quick_sort, gave a version of it in C++ and started to analyze how many steps it takes to sort a vector of floating point numbers. In this entry, we continue that analysis and prove some results that will help us get a feel for other recursive algorithms.
