Hashing, Dictionaries and Graphs
This explains hashing and hash tables. Hashing is next to magic: it allows us to the achieve O(1) lookup behaviour of an array for complex data types. We will emphasise an experimental approach to understand what makes a good hash function.
Tasks for week 4
Programs are in a zipped file – download and extract then open with Idle
Back to course materials.