相关文档

《算法入门》(英文版)Lecture 8 Prof. Charles E. Leiserson

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.
团购合买资源类别:文库,文档格式:PDF,文档页数:19,文件大小:145.78KB
点击进入文档下载页(PDF格式)
共19页,试读已结束,阅读完整版请下载
点击下载(PDF格式)

浏览记录