003.插入排序

#include<iostream> 

using namespace std;

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

int main()
{
	int a[] = { 1,2,3,55,67,42,1,22 };
	InsertSort(a, 8);
	for (int i = 0; i < 8; i++)
	{
		cout << a[i] << " ";
	}
	system("pause");
	return 0;
}