方法一
# include <stdio.h>
void insertSort(int * , int , int );
int main(void)
{
int a[6] = {9, 56, 34, 6 ,99, 8};
int i;
insertSort(a, 0, 5);
for(i=0; i<6; i++)
{
printf("%d ", a[i]);
}
return 0;
}
void insertSort(int * a, int j, int k)
{
int val;
int i;
for ( i = j; i < k; i++)
{
if (a[i+1] < a[i])
{
val = a[i+1];
do{
a[i+1]=a[i];
i--;
}while(a[i]> val);
a[i+1]=val;
}
}
}
----------------------------------------------------------------------------------------------------------------------------------------------------------------
发放二
# include <stdio.h>
void straight_insert_sort(int * p ,int n)
{
int i,j;
int val;
for(i=1;i<n;i++)
{
val = p[i];
j= i-1;
while(j>=0 && val < p[j])
{
p[j+1] = p[j];
j--;
}
if (j != i-1)
p[j+1] = val;
}
}
void prin_arr(int * a ,int n)
{
int i;
for(i=0;i<n; i++){
printf("%-5d", a[i]);
}
return;
}
int main(void)
{
int a[9] = {1, 2, 4, 8, -1, -5, 9 ,44, 5};
printf("thi array is:/n");
prin_arr(a, 10);
straight_insert_sort(a, 10);
printf("the sorted array id:/n");
prin_arr(a,10);
}