O(n)
Big-O Complexity
AP CSA · Unit 10: Recursion & Data Structures
↺ Reset
⛶ Fullscreen
n =
50
Active:
All
n
50
O(1)
1
O(log n)
—
O(n)
—
O(n²)
—
Input Size n
50
Show Curves
O(1)
O(log n)
O(n)
O(n log n)
O(n²)
O(2ⁿ)
Algorithm Examples
Array Access
Binary Search
Linear Search
Merge Sort
Bubble Sort
Selection Sort
Scale
Linear
Log Scale
Info
Quick Quiz
▼
1. A single for-loop over n items is:
O(1)
O(n)
O(n²)
O(log n)
2. A nested loop (for i, for j) is typically:
O(n)
O(n log n)
O(n²)
O(2ⁿ)
3. Binary search's time complexity is:
O(n)
O(1)
O(log n)
O(n²)
Check Answers