Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

4
  • Why would you implement it so that it's O(n) if you can implement it to make it O(1)? Commented Feb 9, 2012 at 16:08
  • well i said in the worst case Commented Feb 9, 2012 at 16:13
  • @JigarJoshi: Can you popin worst case example for getting O(n) run time? Commented Feb 9, 2012 at 20:41
  • 2
    the hash function that returns a single number so all the entries would be in the same bucket Commented Feb 10, 2012 at 3:49