1
//insert sorting
2
#include <stdio.h>
3
#include <stdlib.h>
4
void InsertSort(int array[],unsigned int len)
{
5
int i,j;
6
int temp;
7
for(i=0;i<len;i++)
{
8
temp = array[i];
9
for(j=i;j>0&&temp<array[j-1];j--)
{
10
array[j]=array[j-1];//all larger elements are moved one pot to the right
11
array[j-1]=temp;
12
}
13
}
14
}
15
int main()
{
16
int a[6]=
{12,19,21,69,1,7};
17
int len=6;
18
InsertSort(a,len);
19
for(int i=0;i<len;i++)
{
20
printf("%d ",a[i]);
21
}
22
printf("%\n");
23
system("pause");
24
}
25
//insert sorting2
#include <stdio.h>3
#include <stdlib.h>4

void InsertSort(int array[],unsigned int len)
{5
int i,j;6
int temp;7

for(i=0;i<len;i++)
{8
temp = array[i];9

for(j=i;j>0&&temp<array[j-1];j--)
{10
array[j]=array[j-1];//all larger elements are moved one pot to the right11
array[j-1]=temp; 12
} 13
} 14
}15

int main()
{ 16

int a[6]=
{12,19,21,69,1,7};17
int len=6;18
InsertSort(a,len);19

for(int i=0;i<len;i++)
{20
printf("%d ",a[i]); 21
}22
printf("%\n");23
system("pause");24
}25



