Quicksort (outstanding Dissertations In The Computer Sciences)
by Sedgewick /
1980 / English / PDF
4.9 MB Download
The general field of mathematical analysis of algorithms has come to encompass two quite different kinds of analysis. One type, more commonly referred to as "computational complexity", involves the study of entire classes of algorithms to solve a particular problem, usually from within a fairly general framework. The other, called simply "analysis of algorithms", involves the study of the space and time requirements of particular algorithms and particular implementations of them.
