CSSE 230: Session Notes - Day 26
Topics
- Quicksort
- Recurrence relations
Outline
- [15 min] Quicksort
- [5 min] Definition of recurrence relations
- [30 min] Developing and solving a recurrence relations for
- Worst case of linear search
- Worst case of binary search
- Worst case of merge sort
- Best case of merge sort
- Worst case of quick sort
- Average case of quick sort (if time permits)
- [5 min] Break
- [balance of time] Work on pair project
Resources
Homework
- Day 28, BC: Recurrence homework,
Analysis 2 homework, and Analysis 3 homework