CS136 Study Guide - Linked List, Hash Table
Document Summary
Your algorithm should be both correct and efficient. 7, and we use chaining for collision resolution. U = {0, 1, 2, , 99}: demonstrate the insertion of the keys 0, 1, 2, , 12 into the (initially empty) hash table (in that order). Why or why not: suppose only two insertions of elements in u are made into the initially-empty hash table. If each pair of elements in u is equally likely to be inserted, show that the second insertion causes a collision 14. 3% of the time.
