Skip to content

Added Insertion Sort #24

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

Open
1719pankaj wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Added Insertion Sort #24

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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 InsertionSort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
def InSort(ar):
#Assuming first element is sorted
#start on second element
for i in range(1, len(ar)):
ins = ar[i]
#Save the previous value
j = i-1
#Move all the sorted larger elements ahead
while j>=0 and ar[j] > ins:
ar[j+1] = ar[j]
j = j-1
#Make insertion XD
ar[j+1] = ins

return ar

#Print
print(InSort([5,6,8,9,2,3,66,45,1,25,00,-1]))