Question

Each exchange operation on line 5 of HEAP-INCREASE-KEY typically requires three assignments. Show how to use the idea of the inner loop of INSERTION-SORT to reduce the three assignments down to just one assignment.

Answer 1

http://www.cs.siena.edu/~ebreimer/courses/csis-385-s04/homework/text5.pdf

Answer 2

that should help.

Answer 3

Rhanks @nitesh231381

Answer 4

Thanks*

Answer 5

thanks

Answer 6

No prob.