(arr, i)
| 132 | |
| 133 | |
| 134 | def heapify(arr, i): |
| 135 | left = 2 * i + 1 |
| 136 | right = 2 * i + 2 |
| 137 | largest = i |
| 138 | if left < arrLen and arr[left] > arr[largest]: |
| 139 | largest = left |
| 140 | if right < arrLen and arr[right] > arr[largest]: |
| 141 | largest = right |
| 142 | |
| 143 | if largest != i: |
| 144 | swap(arr, i, largest) |
| 145 | heapify(arr, largest) |
| 146 | |
| 147 | |
| 148 | def swap(arr, i, j): |
no test coverage detected