concept temporary variable in category algorithms

appears as: temporary variable
Algorithms and Data Structures in Action

This is an excerpt from Manning's book Algorithms and Data Structures in Action.

As listing 2.2 shows, we keep swapping elements until either current element gets assigned to the root (line #3), or it's priority is lower than its next ancestor (line #5-#7).
This means that each call to this method can involve at most
logD(n) comparisons and exchanges, because it's upper-bounded by the height of the heap.