You should be able to:
- Articulate the difference between an algorithm and a heuristic
- Explain Big O in terms of both time and space (when/how is it useful, what does it measure, etc.)
- Describe how both Bubble Sort and Merge Sort operate, as well as discuss their time/space complexities