@Karthikeyan : if i have min=2 till now now delete 2 , now what will be min if i call getmin() ??? pointer wont work....
so we need to use stack to keep track of minimum elements so far. On Wed, Mar 7, 2012 at 5:14 PM, Karthikeyan V.B <[email protected]> wrote: > Hi, > > Perfect Hashing can be used > > Insertion - O(1) > Deletion - O(1) > Search any element - O(1) > for getMin() - have a pointer to hold the content of min element which > gets updated during every insertion/deletion > > Regards, > Karthikeyan.V.B > > -- > 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. > -- 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.
