插入排序

#include <stdio.h>
int main()
{
	int i = 0;
	int A[] = {5,2,4,6,1,3};
	Insertion_Sort(A,6);
	for(;i < 6;i++)
		printf("%d ",A[i]);
	return 0;
}

void Insertion_Sort(int A[],int length)
{
	int i,j,key;
	for(j = 1;j < length;j++)
	{
		key = A[j];
		i = j - 1;
		while(i >= 0 && A[i] > key)
		{
			A[i+1] = A[i];
			i = i-1;
		}
		A[i+1] = key;
	}
}