|
摘要：
Hash function:Solution: Use a hash function h(k) to map theuniverse U of all keys into continuous storage spaces{0, 1, ..., m–1}.Collision: When a record to be inserted maps to an alreadyoccupied slot in T.Resolving collisions:At first we assume that each key k ∈ K of keys is equally likely tobe has 阅读全文
摘要：
Why comparison sort has a lower bound at least nlgn,which means T(n)=Ω(nlgn)?Decision-tree can easily tell why. A decision-tree is always a full binary tree. In camparison sort (like merge sort), every step is actually a comparison between 2 elements.And decision-tree list all these comparison cases 阅读全文
|
