Abstract
In this book, the so-called O-notation is used to classify the running time of algorithms. This allows a more formal classification of the complexity of algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The meaning of the notation becomes more understandable on the next page with the presentation of examples for other complexity classes.
- 2.
The time complexity O(2n) is not shown because its growth is too strong to be expressed meaningfully without the use of powers of 10.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature
About this chapter
Cite this chapter
Inden, M. (2022). Quick Start O-Notation. In: Python Challenges. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-7398-2_13
Download citation
DOI: https://doi.org/10.1007/978-1-4842-7398-2_13
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-7397-5
Online ISBN: 978-1-4842-7398-2
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)