Frage im Vorstellungsgespräch bei Amazon
Details about Hashtable? Good hash function? HashTable time complexities? Binary search complexity?
Antworten zu Vorstellungsgespräch
Anonym
10. Feb. 2011
A good hash function has uniform distribution and low amount of collisions. Use of mod is common. Hash table is constant average case search time, whereas binary tree will take O(log n).