排序之三：插入排序

#include <stdio.h>void swap (int a[],int i,int j){int tmp = a[i];a[i] = a[j];a[j] = tmp;}void printA (int *a,int len){int i;for (i = 0; i < len; i++){printf ("%-4d",a[i]);}printf ("\n");}//插入排序int main(){int a[10] = {9,2,1,5,4,7,6,3,8,0};int len = sizeof(a)/sizeof(a[0]);int get;  int i,j;for (i = 1; i < len; i++){get = a[i];j = i-1;while (j >= 0 && a[j] > get){a[j+1] = a[j];j--;}a[j+1] = get;}printA (a,len);return 0;}