One sentence answer to your query is all Hash DataStructure is suppose to provide Constant Time Complexity .i.e.O(1). However as an when HashTable fills up,Data Value collision occurs becoz,common key will generated by HashFunction.Thats where HashFunction dependibility comes into picture.. Well the Worst Case of Time Complxity extremgely poor hash function may go upto O(n). Which is very rare and when data is hash table is fully filled with all colliding values..
On 10/27/11, kumar raja <rajkumar.cs...@gmail.com> wrote: > I am asking for the above quesiton.... > > On 27 October 2011 07:38, kumar raja <rajkumar.cs...@gmail.com> wrote: > >> @Prem : >> So is the time complexity is O(1) or O(log n) or O(n)??? >> >> >> On 27 October 2011 07:28, Prem Krishna Chettri <hprem...@gmail.com> wrote: >> >>> Well, if we talk abt space complexity in Hash.. M srry we require O(n) >>> for Hash Datastructure... As each Bucket can contain at most one data >>> value of Key Value pair,thats where key is gonna hash your value.. >>> >>> However, when we talk abt time complexity, its alwayz, the Hash >>> Function dependable question... >>> >>> On 10/27/11, ligerdave <david.c...@gmail.com> wrote: >>> > I am a bit confused. Are you talking about the runtime of hash function >>> > itself or to find the position. >>> > Agree on the efficient hash function design. However, no function could >>> be >>> > designed to fit all cases. A key to make a particular hash function >>> > efficient is to know the potential data size. >>> > >>> > -- >>> > You received this message because you are subscribed to the Google >>> Groups >>> > "Algorithm Geeks" group. >>> > To view this discussion on the web visit >>> > https://groups.google.com/d/msg/algogeeks/-/G_0Wm4NQIyIJ. >>> > 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. >>> > >>> > >>> >>> -- >>> 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. >>> >>> >> >> >> -- >> Regards >> Kumar Raja >> M.Tech(SIT) >> IIT Kharagpur, >> 10it60...@iitkgp.ac.in >> >> >> > > > -- > 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. > > -- 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.
