- The Fibonacci Sequence (using both iterative and recursive methods)
- Merge Sort (a recursive sorting algorithm)
-
Using iteration
- Starts with [0, 1] and keeps adding the last two numbers until length n.
-
Using recursion
- Builds the sequence by recursively generating fibsRec(n - 1) and adding the last two numbers to the end.
- Recursively splits the array into halves, sorts each half, and merges them back together in sorted order.