Abstract
There is no guarantee that the study of algorithms will produce sums and recurrences with straightforward closed form solutions. In fact much of the adventure of analysis of algorithms lies in the variety of mathematics to which researchers are drawn (at times kicking and screaming) in their attempts to understand algorithms. Frequently the researchers will turn to asymptotic analysis.
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
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Birkhäuser Boston
About this chapter
Cite this chapter
(2008). Asymptotic analysis. In: Mathematics for the Analysis of Algorithms. Progress in Computer Science and Applied Logic (PCS), vol 1. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4729-2_4
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4729-2_4
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4728-5
Online ISBN: 978-0-8176-4729-2
eBook Packages: Springer Book Archive