Show that there are inputs that force every percolateDown in heapsort to go all theway
Chapter 7, Problem 7.13(choose chapter or problem)
Show that there are inputs that force every percolateDown in heapsort to go all theway to a leaf. (Hint: Work backward.)
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