Big O Visualizer
See how algorithms scale as the input grows.
Algorithm
O(1)
O(log n)
O(n)
O(n log n)
O(n²)
O(2ⁿ)
Input Size (n): 25
Estimated Operations
1
Constant Time
-
The amount of work never changes, regardless of the input size. Accessing an array by index always takes one operation.