free course · 5 lessons · en/ar
⚖️ Algorithms: Better Recipes
Why does one program finish in a blink and another in days — on the same machine? Search, sorting and Big-O, taught through code you run and step-counts you watch explode (or not).
what's inside
01 · Think in steps
02 · Order & cost
faq
Do I need math for this?
Arithmetic only. Big-O is introduced as intuition — step counters you run yourself — not as formal proofs.
What should I finish first?
Python: First Steps (or equivalent basics: variables, loops, lists, functions). Every example here is live Python you'll read and modify.
Why do algorithms matter if computers are so fast?
Because growth beats speed: on a million items, a clever recipe needs 20 steps where a naive one needs a trillion. No hardware crosses that gap.
Is this enough for coding interviews?
It's the foundation interviews assume: search, sorting, and reading Big-O. Practice problems come next — this course makes them make sense.