插入排序法:
#include<stdio.h>
#include<stdlib.h>
#define ARRAY_LENGTH (10)
void insert_sort(int *A,int length){
if(A==NULL || length<=0){
return ;
}
for(int j = 1; j<length; j++){
int key = A[j];
int i = j-1;
while(i>=0 && A[i]>key){
A[i+1] = A[i];
i--;
}
A[i+1] = key;
}
}
int main(){
int A[ARRAY_LENGTH] = {1,4,5,6,2,10,9,3,7,8};
insert_sort(A,ARRAY_LENGTH);
for(int i = 0;i<ARRAY_LENGTH;i++){
printf("num %d : %d\n",i,A[i]);
}
system("pause");
return 0;
}