Algorithms Day 12 L8.2 A weakness of hashing Problem: For any hash function h, a set of keys exists that can cause the average access time of a hash table to skyrocket. IDEA: Choose the hash function at random, independently of the keys
The analysis of merge sort fromLecture 1 required us to solve arecurrence. Recurrences are like solving integrals,differential equations, etc.o Learn a few tricks