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.
