Welcome! Let's Explore Speed
Why is some code fast and other code slow? You'll discover the answer by doing, not memorizing. Each lesson is interactive and visual.
📊 How Steps Increase with Data
🎮 Drag the sliders to see how algorithms scale with different input sizes
See how different algorithms behave as the number of items (n) increases
Learn by Doing
Manipulate inputs, watch visualizations, and build intuition
Experiment Freely
No penalties—try different values and see what happens
Feel the Growth
Understand why some algorithms become impractical at scale
📚 Curriculum
O(1) Constant
Instant access, no matter what
Learn why array indexing and hash lookups are lightning fast
O(n) Linear
One step per item
Explore how searching and iterating scale directly with size
O(n²) Quadratic
Nested loops and comparisons
Watch how comparing everything to everything explodes quickly
O(log n) Logarithmic
Divide and conquer
Discover how binary search handles huge datasets efficiently
O(2ⁿ) Exponential
The recursive explosion
See why some recursive problems become impossible to solve
Final Challenge
Test your mastery
Apply what you've learned to real-world scenarios and earn your completion badge
💡 Tips for Success
- 👆 Interact first — Play with sliders and visualizations before reading explanations
- 🔄 Experiment freely — There's no penalty for wrong answers; explore and learn
- 📊 Watch the patterns — Notice how operations grow as input size changes
- 🤔 Think "why?" — Don't just memorize; understand the underlying reasons