Topics:
- Review insertion sort algorithm (Sec 3.1), look at its time complexity (Sec 3.3: O(n^2))
- HW#4 exercises from Sec 3.1 & 3.2:
- Sec 3.1, #42 (insertion sort)
- Sec 3.2, #5 & 23 (showing “big-O” relationships using graphs)
Schedule for remainder of semester:
- Thurs May 12 & Fri May 13: Office hours (via Blackboard Collaborate) for questions re HW#4
- Thurs: 10a-11a
- Fri: 12p-2p
- Mon May 16: HW#4 due; hand out Exam #3 (take-home)
- Wed May 18: Exam #3 due
- Thurs May 19 & Fri May 20: Office hours (via Blackboard Collaborate) for final exam review (times TBA)
- Mon May 23: Final exam
Boardshots:
Leave a Reply