File heap_sort.py

Sorting Algorithms/heap_sort.py:None–None · view source on GitHub ↗

Source from the content-addressed store, hash-verified

1	def heapify(nums, heap_size, root_index):
2	# Assume the index of the largest element is the root index
3	largest = root_index
4	left_child = (2 * root_index) + 1

nothing calls this directly

heap_sortFunction · 0.85

no test coverage detected