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

  • 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]))