Pregunta de entrevista de Yelp
What is the average look-up time for a good hash-function
Respuestas de entrevistas
Anónimo
18 may 2011
basically O(1) (constant) at best, and O(n) (linear) at worst
1
What is the average look-up time for a good hash-function
Anónimo
basically O(1) (constant) at best, and O(n) (linear) at worst