If anbspd-heap is stored as an array for an entry located


1. Each deleteMin operation uses 2 log comparisons in the worst case.

a.  Propose a scheme so that the deleteMin operation uses only log + log log + O(1) comparisons between elements. This need not imply less data movement.

b. Extend your scheme in part (a) so that only log + log log log O(1) comparisons are performed.

c. How far can you take this idea?

d. Do the savings in comparisons compensate for the increased complexity of your algorithm?

2. If a d-heap is stored as an array, for an entry located in position i, where are the parents and children?

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: If anbspd-heap is stored as an array for an entry located
Reference No:- TGS01274639

Expected delivery within 24 Hours