排序算法代码---插入排序

#include <stdio.h>
void insertionSort(int A[], int len);
void show(int A[], int len);
int main()
{
	int A[] = {1, 3, 2, 5, 7};
	int len = 5;
	insertionSort(A, 5);
	show(A, 5);
	return 0;
}
void insertionSort(int A[], int len)
{
	// 已知A[0..i-1]已排序，将A[i]插入使得A[0..i]成为新的已排序数组
	for (int i=1; i<len; ++i)
	{
		int x = A[i];
		int j = i - 1;
		while (j>-1 && A[j] > x)
		{
			A[j+1] = A[j];
			--j;
		}
		A[j+1] = x;
	}
	return ;
}
void show(int A[], int len)
{
	for (int i=0; i<len; ++i)
		printf("%d/n", A[i]);
	return ;
}