# Big-O Complexity Visualizer

Source: https://www.techinterview.org/big-o-visualizer/
Updated: 2026-06-30 · techinterview.org

Big-O describes how the work grows as the input gets bigger. The gap between classes is the whole game: at n = 50, an O(log n) algorithm does about 6 steps while O(2ⁿ) does a quadrillion. Move the slider to see it.

    Input size n = 20
    *

    **Go deeper**
    [Big-O cheat sheet](/big-o-cheat-sheet/)
    [Algorithm patterns](/algorithm-patterns-cheat-sheet/)
    [Study plan generator](/study-plan/)