# | Line 727 | Line 727 | public class PriorityQueue<E> extends Ab | |
---|---|---|
727 | /** | |
728 | * Establishes the heap invariant (described above) in the entire tree, | |
729 | * assuming nothing about the order of the elements prior to the call. | |
730 | + | * This classic algorithm due to Floyd (1964) is known to be O(size). |
731 | */ | |
732 | @SuppressWarnings("unchecked") | |
733 | private void heapify() { |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |