Sorting: Insertion Sort

Sorting: Insertion Sort

 

 

https://youtu.be/bPlYH--OYNc

 

def insertionSort(arr):
	# Traverse through 1 to len(arr)
    for i in range(1, len(arr)):
        j = i - 1
        while j >= 0 and arr[j + 1] < arr[j]:
            # arr[j] and arr[j + 1] are out of order so swap them 
            tmp = arr[j + 1]
            arr[j + 1] = arr[j]
            arr[j] = tmp
            j -= 1
    return arr

 

• Stableity: Stable 안정
• Time Complexity:
  • Best: O(n)
  • Worst: O(n^2)
  • Average: O(n^2)
• Space Complexity: O(1)