insertion sort python
#Insertion sort
ar = [34, 42, 22, 54, 19, 5]
for i in range(1, len(ar)):
while ar[i-1] > ar[i] and i > 0:
ar[i-1], ar[i] = ar[i], ar[i-1]
i -= 1
print(ar)
insertion sort python
#Insertion sort
ar = [34, 42, 22, 54, 19, 5]
for i in range(1, len(ar)):
while ar[i-1] > ar[i] and i > 0:
ar[i-1], ar[i] = ar[i], ar[i-1]
i -= 1
print(ar)
insertion sort in python
def insertion(s):
for i in range(0,len(s)-1):
if s[i]>s[i+1]:
s[i],s[i+1]=s[i+1],s[i]
for j in range(i,0,-1):
if s[j]<s[j-1]:
s[j],s[j-1]=s[j-1],s[j]
print(s)
insertion([5,2,1,9,0,4,6])
Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us