Each deleteMin operation uses 2 logN comparisons in the worst case. a. Propose a scheme
Chapter 6, Problem 6.13(choose chapter or problem)
Each deleteMin operation uses 2 logN comparisons in the worst case. a. Propose a scheme so that the deleteMin operation uses only logN + log logN +O(1) comparisons between elements. This need not imply less data movement. b. Extend your scheme in part (a) so that only logN + log log logN + 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 youralgorithm?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer