点击(此处)折叠或打开
-
#include <stdio.h>
-
-
void sort(int *a,int size)
-
{
-
int j = 1, i = j-1,cur = a[j];
while(j < size){
if(i >=0 && a[i+1] < a[i]){
a[i+1] = a[i];
a[i] = cur;
i--;
}else{
j++;
i = j-1;
cur = a[j];
}
}
-
}
-
int main(void)
-
{
-
int index = 0;
-
int num[] = {8,2,4,9,3,6,1,7,5,0};
-
int length = sizeof(num)/sizeof(int);
-
-
sort(num ,length);
-
-
while(index < length){
-
printf("%d\n" ,num[index++]);
-
}
-
return 0;
- }