Python Challenges: 100 Proven Programming Tasks Designed to Prepare You for Anything

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

M. IndenPython Challengeshttps://doi.org/10.1007/978-1-4842-7398-2_13

Quick Start 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.

C.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 the consequences of design ...