Week 14: Hash Tables and Sorting Algorithms
SLOs for Week 14
At the end of this unit, students will be able to…
- Hash Tables:
- write the basic data structure for storing items in a hash table.
- reason about important properties of a good hash algorithm.
- identify the time complexity of each operation on a hash table.
- reason about the time-space tradeoff manifested in a hash table.
- Sorting Algorithms
- describe the crucial ideas behind Insertion Sort and Selection Sort.
- identify the crucial differences between Insertion and Selection Sort.
- identify the time complexity of Insertion and Selection sort in best and worst cases.
Slides, videos, and application exercises
Project 14: No Project
Final Exam Search calvin.edu for “Exam Schedule” to find the time of the exam (and all exams you have, this semester, and all future semesters).