Ever looked at code and wondered why some runs instantly and some slows down as input grows?
A new section has been added to make time and space complexity easier to understand visually.
👉 https://decoded-app.com/complexity
What’s included
Instead of treating Big-O as theory, this section focuses on how things actually behave.
Visual comparison of complexities
You can see how different complexities grow as input increases:
- O(1)
- O(log n)
- O(n)
- O(n log n)
- O(n²)
The idea is simple — understand how the number of steps increases.
Code → complexity mapping
Common patterns are broken down so it’s easier to identify complexity directly from code:
- constant operations
- single loops
- nested loops
- input shrinking patterns
Space complexity
There’s also a separate section for memory usage:
- constant space
- linear space
- recursive space
Focused on how and when memory grows.
That’s the update :)
Top comments (0)