Design a data structure that allows one to search, insert, and delete an integer X in O (1) time in a table (i.e. constant time, independent of the total number of integers stored). Assume that 1≤X≤N. Also assume that the maximum number of integers in the table can only be M at any one time. You are given M+N units of space available for the table.
-- 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.
