 The sift-down function extends the heap property to "b"−1, "b", "b"+1, ..., "e".Only index "i" = "b"−1 can violate the heap property.Let "j" be the index of the largest child of "a"["i"] (for a max-heap, or the smallest child for a min-heap) within the range "b", ..., "e".