Algorithmic Thinking

Master search, recursion, sorting, and dynamic programming to solve complex problems efficiently.

Concepts in this path

  1. Recursion — Functions That Call Themselves: Visualize recursion — watch factorial build and unwind the call stack, see what happens without a base case, and compare a Fibonacci call tree with and without memoization.
  2. Binary Search: Step through binary search one comparison at a time, click any cell to search for it, and see why a million sorted items need at most 20 comparisons.
  3. Sorting — Putting Things in Order: Compare bubble, selection, insertion, merge, and quicksort side-by-side — watch algorithms sort arrays in real time with step-by-step visualization.
  4. Dynamic Programming: Visualize dynamic programming interactively — compare the naive Fibonacci recursion tree with a memoization table filled cell by cell to see how caching subproblems turns O(2ⁿ) into O(n) time.