Created
March 10, 2018 09:32
-
-
Save meetzaveri/c3e28c5e5a773ecb46c14b5aedca3c1a to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Python program for implementation of Insertion Sort | |
# Function to do insertion sort | |
def insertionSort(arr): | |
# Traverse through 1 to len(arr) | |
for i in range(1, len(arr)): | |
key = arr[i] | |
# Move elements of arr[0..i-1], that are | |
# greater than key, to one position ahead | |
# of their current position | |
j = i-1 | |
while j >=0 and key < arr[j] : | |
arr[j+1] = arr[j] | |
j -= 1 | |
arr[j+1] = key | |
# Driver code to test above | |
arr = [12, 11, 13, 5, 6] | |
insertionSort(arr) | |
print ("Sorted array is:") | |
for i in range(len(arr)): | |
print ("%d" %arr[i]) | |
# This code is contributed by Mohit Kumra |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment