= Recursion, Divide and Conquer, Sorting

This section will cover:

- Recursion basics
  - Factorial
  - Tail recursion
  - Bounding recursive functions
- Coming up with recursive algorithms: Divide and conquer
  - Sorted Array as an ADT
  - Sort algorithms: Merge Sort
- Expected Runtime Complexity
  - Sort algorithms: Quick Sort