#include <stdio.h>
int main()
{
int keys[]={8,2,4,9,3,6};
int length=6;
void printarray(int,int[]);
void sort(int,int[]);
printf("before insert sort-> /n");
printarray(length,keys);
printf("/n");
sort(length,keys);
printf("after insert sort-> /n");
printarray(length,keys);
printf("/n");
}
/**
*print array typeof integer
**/
void printarray(int length,int keys[])
{
int i=0;
for(;i<length-1;i++)
{
printf("%d,",keys[i]);
}
printf("%d",keys[i]);
}
/**
*sort array by insert method
**/
void sort(int length,int keys[])
{
int key=-1;
int i=1;
int j=0;
for(;i<length;i++)
{
key=keys[i];
j=i-1;
while(j>=0&&keys[j]>key)
{
keys[j+1]=keys[j];
j--;
}
keys[j+1]=key;
}
}
int main()
{
int keys[]={8,2,4,9,3,6};
int length=6;
void printarray(int,int[]);
void sort(int,int[]);
printf("before insert sort-> /n");
printarray(length,keys);
printf("/n");
sort(length,keys);
printf("after insert sort-> /n");
printarray(length,keys);
printf("/n");
}
/**
*print array typeof integer
**/
void printarray(int length,int keys[])
{
int i=0;
for(;i<length-1;i++)
{
printf("%d,",keys[i]);
}
printf("%d",keys[i]);
}
/**
*sort array by insert method
**/
void sort(int length,int keys[])
{
int key=-1;
int i=1;
int j=0;
for(;i<length;i++)
{
key=keys[i];
j=i-1;
while(j>=0&&keys[j]>key)
{
keys[j+1]=keys[j];
j--;
}
keys[j+1]=key;
}
}