Skip to content

added insertion sort #16

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.

Sign up for GitHub

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

Merged
merged 3 commits into from
Sep 25, 2020
Merged

added insertion sort #16

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
a2b865e
Create insertionsort.py
jayadevvasudevan Sep 25, 2020
c02256e
Update insertionsort.py
jayadevvasudevan Sep 25, 2020
c9bb226
Update insertionsort.py
jayadevvasudevan Sep 25, 2020
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
26 changes: 26 additions & 0 deletions Sorting_Searching/insertionsort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
def insertion_sort(array):

# We start from 1 since the first element is trivially sorted
for index in range(1, len(array)):
currentValue = array[index]
currentPosition = index


while currentPosition > 0 and array[currentPosition - 1] > currentValue:
array[currentPosition] = array[currentPosition -1]
currentPosition = currentPosition - 1



array[currentPosition] = currentValue
print("array now : ")
print(array)
array = []
n = int(input("Enter number of elements : "))
for i in range(0, n):
ele = int(input())

array.append(ele) # adding the element

insertion_sort(array)
print("sorted array: " + str(array))