Swipe to navigate through the chapters of this book
This chapter introduces the idea of measuring the algorithm performance, of basic operation counting, and of classes of algorithms. It then proceeds to discuss the difference between various classes of algorithms and their behavior with respect to the increase of the problem size.
Please log in to get access to this content
To get access to this content you need the following product:
The Quicksort algorithm is notorious for its sensitivity to minor changes in its implementation in code. The slightest change will almost certainly make the code perform incorrectly on some data. Many erroneous versions of Quicksort have been published in journals and texts on programming.
- Springer International Publishing
- Sequence number
- Chapter number
- Chapter 1