∞
#web-development
Recursion
What I learned:
- Quick sort and quick select are indeed very quick.
- Solve for the base case and then break down the problem into smaller sub-problems.
- You can approach a problem from the top down or the bottom up.
- Bottom up means you start with the smallest sub-problem and work your way up to the larger problem.
- Top down means you start with the larger problem and break it down into smaller sub-problems.
- Recursion is a powerful tool for solving problems.
- “Dynamic Programming” really just means “recursion with memoization”. Store the result so you don’t have to recompute it. The subproblems will often overlap and repeat which can make your recursion inefficient.