Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Vrajitoru, D., Knight, W. (2014). Introduction. In: Practical Analysis of Algorithms. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-09888-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-09888-3_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09887-6
Online ISBN: 978-3-319-09888-3
eBook Packages: Computer ScienceComputer Science (R0)