Swipe to navigate through the chapters of this book
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.
Please log in to get access to this content
- Fundamental Notations in Analysis of Algorithms
- Springer International Publishing
- Sequence number
- Chapter number
- Chapter 3