Java Challenges: 100+ Proven Tasks that Will Prepare You for Anything

© The Author(s), under exclusive license to APress Media, LLC, part of Springer Nature 2022

M. IndenJava Challengeshttps://doi.org/10.1007/978-1-4842-7395-1_14

Quick Start for O-notation

Michael Inden¹  

(1)

Zurich, Switzerland

 

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.

1 Estimations with O-notation

To estimate and describe the complexity of algorithms and classify their running time behavior, it would be impractical to always take measurements. In addition, measurements only reflect the running time behavior under certain restrictions of the hardware (processor clock, memory, etc.). To be able to classify consequences of design ...