插入排序算法(备忘)
#include <stdio.h>
void insert(int* a,int len) {
int i,j;
for(i=1;i<len;i++) {
for(j=i;j>0 && a[j]<a[j-1];j--) {
int t = a[j-1];
a[j-1] = a[j];
a[j] = t;#include <stdio.h>
void insert(int* a,int len) {
int i,j;
for(i=1;i<len;i++) {
for(j=i;j>0 && a[j]<a[j-1];j--) {
int t = a[j-1];
a[j-1] = a[j];
a[j] = t;
}
}
}
void print(int* a,int len) {
int i = 0;
for(;i<len;i++) {
fprintf(stdout,"%d ",a[i]);
}
printf("\n");
}
int main(void) {
int a[] = {3,2,33,46,1,2,31,12,23,4,31251,123,1,23,13,14,123,4,1234};
int len = sizeof(a)/sizeof(int);
print(a,len);
insert(a,len);
print(a,len);
return 0;
}