Abstract
This chapter lays the foundation of the analysis of algorithms theory in terms of the big-oh, omega, and theta notations. It also covers the related topics of the little-oh and asymptotic functions. The chapter contains formal definitions of these notations, examples of how they are proved, and theorems connecting these notations to each other. Properties of the functions introduced in the previous chapter are used here to prove the relationships defined by the fundamental notations for a variety of expressions.
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
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). Fundamental Notations in Analysis of Algorithms. In: Practical Analysis of Algorithms. Undergraduate Topics in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-09888-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-09888-3_3
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)