Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added Insertion Sort Code using Python #170

Merged
merged 1 commit into from
Oct 7, 2020
Merged
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
19 changes: 19 additions & 0 deletions Insertion_Sort/Insertion_Sort.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
# Python program for implementation of Insertion Sort

def insertionSort(arr):

for i in range(1, len(arr)):

key = arr[i] # Move elements of arr 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

print("Enter the array elements : ")
arr = list(map(int,input().split()))
insertionSort(arr)
print ("\nSorted array is ",str(arr))