Question d’entretien chez Yelp
What is the average look-up time for a good hash-function
Réponses aux questions d'entretien
Utilisateur anonyme
18 mai 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
Utilisateur anonyme
basically O(1) (constant) at best, and O(n) (linear) at worst