Lecture 8: Hashing I

Online text: ocw.mit.edu/courses/6-006-introduction-to-algorithms-fall-2011/d3e4d64266d481c74c9e7c15e09999fe_MIT6_006F11_lec08.pdf

Cited passages: Lecture 8: Hashing I, p. 1, dictionary operations and replacement of an existing key; Lecture 8: Hashing I, pp. 4–5, chaining worst case and simple uniform hashing assumption.

Cited passages: MIT 6.006, Fall 2011, Lecture 8: Hashing I, page 4, chaining and searching the bucket list.