Frequently Asked Questions
Everything you need to know about the Big O Notation Calculator.
What is Big O notation?
A way of describing how an algorithm's time or space requirements grow as input size increases, ignoring constant factors.
What operations are in the reference table?
Common array, sorting, searching, hash map, tree, and graph operations with their time/space complexity.
Is it free?
Completely free, no sign-up or limits.
What does the growth-rate chart show?
How different complexity classes (O(1) to O(n!)) diverge as input size n increases, with a log-scale option for large n.
What does the "estimate operations" calculator do?
Given a complexity class and an input size, it estimates roughly how many operations that algorithm performs.
Why do some algorithms show best/average/worst case separately?
Because their performance depends on input arrangement (e.g. quicksort's worst case differs from its average case).
Can I search the reference table?
Yes, filter by algorithm name or complexity class.
Is this useful for coding interviews?
Yes, it's designed as a quick-reference and intuition-builder for interview prep.
Is my data stored?
No; everything runs in your browser.
Does it work on mobile?
Yes, fully responsive; the chart and table adapt to smaller screens.