def min_heap_sort(arr, simulation=False):
iteration = <NUM_LIT:0><EOL>if simulation:<EOL><INDENT>print("<STR_LIT>",iteration,"<STR_LIT::>",*arr)<EOL><DEDENT>for i in range(<NUM_LIT:0>, len(arr) - <NUM_LIT:1>):<EOL><INDENT>iteration = min_heapify(arr, i, simulation, iteration)<EOL><DEDENT>return arr<EOL>
Heap Sort that uses a min heap to sort an array in ascending order
        Complexity: O(n log(n))