We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 1
  5. Discussions

Insertion Sort - Part 1

  • patrickgao2020
     + 0 comments

    Here's my Python solution.

    def insertionSort1(n, arr):
    insert = arr[-1]
    index = list(reversed([i for i in range(len(arr) - 1)]))
    for i in index:
        if insert <= arr[i]:
            arr[i + 1] = arr[i]
            print(" ".join([str(i) for i in arr]))
        else:
            arr[i + 1] = insert
            print(" ".join([str(i) for i in arr]))
            return
    arr[0] = insert
    print(" ".join([str(i) for i in arr]))