Domanda di colloquio di Yelp
What is the average look-up time for a good hash-function
Risposte di colloquio
Anonimo
18 mag 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
Anonimo
basically O(1) (constant) at best, and O(n) (linear) at worst