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
#include <bits/stdc++.h>
using namespace std;
void insertionSort(int arr[], int n)
{
int i, temp, j;
for (i = 1; i < n; i++)
{
temp = arr[i];
j = i - 1;
while (j >= 0 && arr[j] > temp)
{
arr[j + 1] = arr[j];
j = j - 1;
}
arr[j + 1] = temp;
}
}
int main()
{
int arr[] = { 1,4,2,5,333,3,5,7777,4,4,3,22,1,4,3,666,4,6,8,999,4,3,5,32 };
int n = sizeof(arr) / sizeof(arr[0]);
insertionSort(arr, n);
for(int i = 0; i < n; i++){
cout << arr[i] << " ";
}
return 0;
}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
