Lesson 26: A simple sort of selection

Outline:

  1. Review of recursion
    • stepping through recursive function calls
    • doing too much work: Fibonacci
  2. Mini-quiz
  3. Selection sort
    • algorithm and example
    • runtime: Exercise

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

  • Zelle section 13.3.1 (pp. 477-478)