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. Practice
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 2
  5. Discussions

Insertion Sort - Part 2

  • alison_thaung + 3 comments

    Here's another, slightly condensed Python3 solution

    s = int(input().strip())
ar = [int(temp) for temp in input().strip().split(' ')]

def insertionSort(ar, i):
    new = sorted(ar[:i+1]) + ar[i+1:]
    return ' '.join(str(k) for k in new)

for i in range(1, s):
    print(insertionSort(ar, i))

    • kerryjones21 + 1 comment

      Using an in-built sort function defeats the purpose of learning sorting algorithms...

      • Aryan__jain + 0 comments

        then you will like this

        def insertionSort2(n, arr):

        for i in range(n):
    k =i
    ele = arr[i]
    while(k>0 and ele<arr[k-1]):
        arr[k] = arr[k-1]
        k = k-1
    arr[k] = ele
    if i!=0:
        print(' '.join([str(x) for x in arr]))

    • aakritigupta110 + 0 comments

      coooooollll..... u are a true coder....

    • avengerravi8055 + 0 comments

      That what smart man ... u r cool