(arr)
Heap Sort that uses a min heap to sort an array in ascending order
        Complexity: O(n log(n))
Heap Sort that uses a min heap to sort an array in ascending order
        Complexity: O(n log(n))
Heap Sort that uses a min heap to sort an array in ascending order Complexity : O ( n log ( n ))
def min_heap_sort(arr):
    """ Heap Sort that uses a min heap to sort an array in ascending order
        Complexity: O(n log(n))
    """
    for i in range(0, len(arr) - 1):
        min_heapify(arr, i)
def min_heap_sort ( arr ) : for i in range ( 0 , len ( arr ) - 1 ) : min_heapify ( arr , i )