Outline:

0. Questions?
1. Review of recursion
   • recursion fundamentals
   • doing too much work: Fibonacci
2. Sorting algorithms
   • example: selection sort
   • runtime: Exercise

What’s next

What you should do now:

• Submit Code Part 2 of your final project by 10pm today if you’re using a token (or tomorrow if using two) on Monday
• Start your project writeup

Reading assignment (to be completed by the next class):

• Zelle section 14.3.1 (pp. 491–492)
• Runestone: Selection Sort