insertion sort
def sortNumList(list1):
x = len(list1)-1
while True:
index = 0
while True:
if list1[index] > list1[index+1]:
get = list1[index], list1[index+1]
list1[index+1], list1[index] = get
# print(list1[index], list1[index+1])
index +=1
if index == x:
break
if(all(list1[i] <= list1[i + 1] for i in range(len(list1)-1))):
break
return list1insertion sort
function insertionSortIterativo(array A)
for i ← 1 to length[A]
do value ← A[i]
j ← i-1
while j >= 0 and A[j] > value
do A[j + 1] ← A[j]
j ← j-1
A[j+1] ← value;Insertion Sort
# 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)
for i in range(len(arr)):
print ("% d" % arr[i])
# This code is contributed by Mohit KumraCopyright © 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
