Question

Problem 3 Suppose that you have a set of n large, orderable, objects, each of size q, so that it requires time e(a) to time to compute a hash function h(a) for any object and requires time e(g) to compare any two objects. Describe a compound data structure, built out of a heap and a hash table, that supports the following operations with the specified run times.. elt (x) Is x an element of the set? Expected run time O(g). run time O(q log n). Add x to the set. Expected add (x) run time O(qloğ n). Here, note that, in a heap, Delete x from the set. Expected delete (x) when you replace x by the last element y, x may be either greater than y or less than y and your algorithm has to consider both cases. min (x)- Return the minimum element in the set. Worst case run time O(1).

Answer 1

problens-3 CoMpaund data shucture (rin-heap binany usc here wc andl a hash tube) dree ave Arrery-based dale storege achieve the A's both uses can usa they and we Specaitieal tinie-compenites On opera tion opevca tion elt a) since, hash tab le Suppert (ontout time for rehevial o0 and gwen to compute hash value vequive ole) time we So ye quive olir) thun wich

opera tHonaddl (a) (alegn) Time compleaity hash value talces ola) since romputing Here Cwhlch is actually the inde) ol we use heap data struetunc Awrany And (logn) for Insetion, So as it tabe Hetally (7 logm) tme operation ! delete (a) K Time comperity (alen) corpute hac Value xequine ole) STo JAND to dele le ve quie oltoy) sne we we have to last cemeal to the phce of and Yeplace it treiy, n furtev Step to teep haap Po par fy clean (oPave witn all of its childvren, and Suwnp i tequive

dont requive any sunp at best case we So, dume cenplenity ola) nee d to corpare at cworst case we lo e all tue oay to down, whlch Bqeel to tgh hcignt of tre (loqn) so, totl copleity Time compleaityo0 Pmp bnrent mt-hrap t Neguives Constaut time to fnal the rinimu eleret -i0 we hahwivihs Ycot sete CLS, The tre list