Loading ComplexityLab

O(1)Binary SearchifO(log n)Merge SortreturnO(n)DFSBFSwhileO(n log n)Quick SortmidpivotTrieHeapDPGreedyHashMapforelseconstclassasyncawaitleftrightn++i++O(n²)O(2ⁿ)

ComplexityLab

Secure workspace

Create your account

Start analyzing complexity in seconds

By continuing you agree to the Terms of Service and Privacy Policy.

Already have an account? Sign in

ComplexityLab account

Your Big-O practice, saved where you left it.

Sign in once, then analyze code, save useful traces, and build a history of patterns you can revisit before interviews.

Analyze code complexity

Keep saved history

Protected workspace