It can be true if the hash table is used properly. If the table becomes too full or the hash function produces too many collisions it will not be constant time. So designing the hash system well remains very important. Don
On Oct 25, 12:15 am, kumar raja <rajkumar.cs...@gmail.com> wrote: > I have read that Hash table provides storing/search operations in constant > time. > > Is it true?? How to prove it?? > > I have not found any sort of proof for it... > > -- > Regards > Kumar Raja > M.Tech(SIT) > IIT Kharagpur, > 10it60...@iitkgp.ac.in -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
