Pergunta de entrevista da empresa Yelp
What is the average look-up time for a good hash-function
Respostas da entrevista
Sigiloso
18 de mai. de 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
Sigiloso
basically O(1) (constant) at best, and O(n) (linear) at worst