/**
*Straight Insertion Sort
**/
#define keyType int
#include<stdio.h>
int insertSort(keyType array[],int n)
{
keyType tmp;
for(int i = 1;i < n;i++)
{
tmp = array[i];
int j = i -1;
while(j >= 0 && array[j] > tmp)//if ' array < tmp ',descend
array[j+1] = array[j--];
array[j+1] = tmp;
}
return 0;
}
int main()
{
keyType arr[10] = {6,4,72,10,4,51,23,100,47,0};
printf("the array before sorted is :\n");
for(int i = 0;i < 10;i++)
printf("%d ",arr[i]);
insertSort(arr,10);
printf("\nthe result of insertion sorting is :\n");
for(int j = 0;j < 10;j++)
printf("%d ",arr[j]);
printf("\n");
return 0;
}
浙公网安备 33010602011771号