Abstract
Algorithms are the most important and durable part of computer science because they can be studied in a language- and machine-independent way. This means we need techniques that let us compare the efficiency of algorithms without implementing them. Our two most important tools are (1) the RAM model of computation and (2) the asymptotic analysis of computational complexity.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Skiena, S.S. (2020). Algorithm Analysis. In: The Algorithm Design Manual. Texts in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-030-54256-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-54256-6_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-54255-9
Online ISBN: 978-3-030-54256-6
eBook Packages: Computer ScienceComputer Science (R0)