@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 <[email protected]> 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 <[email protected]> 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 [email protected]. > > To unsubscribe from this group, send email to > > [email protected]. > > 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Regards Kumar Raja M.Tech(SIT) IIT Kharagpur, [email protected] -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
