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