算法代码实现之插入排序，C/C++实现

//交换数组元素
void swap(int *a,int i,int j)
{
int t = a[i];
a[i] = a[j];
a[j] = t;
}
//插入排序
void insertion_sort(int *a,int len)
{
int i,j;
if (len < 2)
{
return;
}
for (i = 1; i < len; i++)
{
for (j = i; j > 0 && a[j] < a[j - 1]; j--)
{
swap(a, j, j - 1);
}
}
}

//打印输出数组
void print_arr(int *a,int len)
{
int i;
if(len<1)  //数组长度必须大于0
{
printf("length greater than 0");
return;
}
//打印整个数组
printf("[");
for(i=0; i<len-1; i++)
{
printf("%d ",a[i]);
}
printf("%d]\n",a[len-1]);
}

int main()
{
int a[] = {9,0,6,5,8,2,1,7,4,3};
int len = sizeof(a)/sizeof(int);
print_arr(a,len);
insertion_sort(a,len);
print_arr(a,len);
return 0;
}