0 votes 0 votes 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. Algorithms cormen algorithms binary-heap descriptive + – akash.dinkar12 asked Jun 27, 2019 akash.dinkar12 260 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.