Organizing Random Data
Kent Quanrud · 31:23
This lecture shows how dictionaries and maps (insert, delete, lookup of key–value pairs) can approach array-speed access without paying for a universe-sized table: when keys look uniformly random, a smaller array plus...