Big-O Complexity Big-O Complexity Explorer Pick a complexity class, plug in n, and see how fast it grows. Then compare with real algorithms like sorting, search, or graph traversals. Quick Explorer Compare Classes Reference 1. Choose complexity & input size Complexity O(1) O(log n) O(n) O(n log n) O(n²) O(2ⁿ) O(n!) n (input size) Try 10, 100, 1000… Estimate growth 2. Output Complexity — Estimated steps — Growth feeling — Example — Compare common complexities for the same n n Compare Class Formula used Steps @ n Comment Click “Compare” to fill the table. Common algorithms and Big-O Algorithm Time Notes Linear search O(n) Scan one by one. Binary search O(log n) Requires sorted array. Merge sort O(n log n) Optimal general sort. Bubble sort (worst) O(n²) Educational, not optimal. DFS

Calculators in Big-O Complexity Big-O Complexity Explorer Pick a complexity class, plug in n, and see how fast it grows. Then compare with real algorithms like sorting, search, or graph traversals. Quick Explorer Compare Classes Reference 1. Choose complexity & input size Complexity O(1) O(log n) O(n) O(n log n) O(n²) O(2ⁿ) O(n!) n (input size) Try 10, 100, 1000… Estimate growth 2. Output Complexity — Estimated steps — Growth feeling — Example — Compare common complexities for the same n n Compare Class Formula used Steps @ n Comment Click “Compare” to fill the table. Common algorithms and Big-O Algorithm Time Notes Linear search O(n) Scan one by one. Binary search O(log n) Requires sorted array. Merge sort O(n log n) Optimal general sort. Bubble sort (worst) O(n²) Educational, not optimal. DFS.