Pulsars
0 %
Log inSign up

Algorithmic Complexity

Measure how fast an algorithm is without timing it: Big-O notation, common complexity classes, and how to read the cost of a loop. With curves and a comparison table to visualize the combinatorial explosion.

Advanced 65 min 30 viewsinformatiquealgorithmiquecomplexitegrand-operformance

Table of contents

  1. 01

    Counting Operations

  2. 02

    The Major Complexity Classes