Amazon interview question
Details about Hashtable? Good hash function? HashTable time complexities? Binary search complexity?
Interview Answers
Anonymous
Feb 10, 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).