mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2025-04-03 20:23:52 +01:00
Recursion
Recursive functions must have both:
- one or more base cases
- a recursive case
The base cases are required to ensure the recursion stops when meeting a condition
The recursive case adds functions onto the call stack and completes each one top down.
Note. Quicksort should be implemented using a random pivot to ensure average runtimes.