338 views
0 votes
0 votes
Suggest how to implement a direct-address table in which the keys of stored elements do not need to be distinct and the elements can have satellite data. All three dictionary operations ($INSERT$,$ DELETE$, and $SEARCH$) should run in $\mathcal{O}(1)$ time. (Don’t forget that $DELETE$ takes as an argument a pointer to an object to be deleted, not a key.)

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
3
akash.dinkar12 asked Apr 4, 2019
848 views
Suppose that a dynamic set $S$ is represented by a direct-address table $T$ of length $m$. Describe a procedure that finds the maximum element of $S$. What is the worst-c...
0 votes
0 votes
0 answers
4