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.
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
Notes
- 1.
The meaning of the notation becomes more understandable on the next page with the presentation of examples for other complexity classes. For a more advanced illustration, see www.linux-related.de/index.html?/coding/o-notation.htm.
- 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 for O-notation. In: Java Challenges. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-7395-1_14
Download citation
DOI: https://doi.org/10.1007/978-1-4842-7395-1_14
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-7394-4
Online ISBN: 978-1-4842-7395-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)