A+DS

Complexity Explorer

n = 50
010002k3k4k5k01020304050Input size (n)OperationsO(1)O(log n)O(n)O(n log n)O(n²)O(2ⁿ)

Growth Rates

Hover a curve

Hover or click a growth rate to see which algorithms belong to it.

At n = 50

O(1)1.0
O(log n)5.6
O(n)50
O(n log n)282
O(n²)2.5K
O(2ⁿ)> 1B