Skip to main content
RugvAI Labs
Show chat and tutor
Python
Rugv
AI
Labs
Learn
Practice
Reference
Blog
Search...
⌘K
తె
Sign In
RugvAI Labs
All playgrounds →
Big O Complexity Visualizer
Input size (n)
n = 100
0.0
2.2K
4.4K
6.6K
8.8K
11.0K
0
20
40
60
80
100
Input size (n)
Operations
Complexity
Name
Example
Ops at n=100
O(1)
Constant
dict lookup
1.0
O(log n)
Logarithmic
binary search
6.6
O(n)
Linear
linear search
100
O(n log n)
Linearithmic
merge sort
664
O(n²)
Quadratic
bubble sort
10.0K
O(1)
O(log n)
O(n)
O(n log n)
O(n²)
Hover curves or rows for details