Question d’entretien chez Amazon

Details about Hashtable? Good hash function? HashTable time complexities? Binary search complexity?

Réponses aux questions d'entretien

Utilisateur anonyme

10 févr. 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).

Utilisateur anonyme

18 févr. 2011

hash table time complexity is O(1)