Insertion Sort - Part 2

  • + 0 comments

    Here is my Python solution.

    def print_array(arr):
        print(' '.join(map(str, arr)))
    
    def insertionSort2(n, arr):
        for i in range(1, n):
            for j in range(i):
                if arr[j] > arr[i]:
                    arr[i], arr[j] = arr[j], arr[i]
            print_array(arr)
    

    `