← Back to Tools
Big O Complexity Analyzer
Paste your code for a time and space complexity estimate. It reads loop nesting, halving loops, sorts and recursion. It does not run your code, so check the result against your own reasoning.
Paste your code and click analyze to see complexity breakdown
Big O Complexity Reference
O(1)
Constant
Array access, hash lookup
O(log n)
Logarithmic
Binary search
O(n)
Linear
Single loop, linear search
O(n log n)
Linearithmic
Merge sort, heap sort
O(n²)
Quadratic
Nested loops, bubble sort
O(2ⁿ)
Exponential
Recursive fibonacci, subsets
O(n!)
Factorial
Permutations, traveling salesman
Master Algorithm Complexity
Practice coding problems in the built-in editor, then explain the complexity out loud the way you would in an interview.
Put it into practice
Try a written practice preview, or read a guide for your next session. The preview needs no account; saved practice requires sign-in.