基本排序算法--插入排序

#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 && key < a[j])
		{
			a[j + 1] = a[j];
			--j;
		}
		a[j + 1] = key;
	}
}

int main()
{
	int array[] = { 34, 65, 12, 43, 67, 5, 78, 10, 3, 70 };
	int len = sizeof(array) / sizeof(int);
	cout << "the original array are:" << endl;
	for (int k = 0; k < len; k++)
		cout << array[k] << " ";
	cout << endl;
	InsertSort(array, len);
	cout << "The sorted array are:" << endl;
	for (int k = 0; k<len; k++)
		cout << array[k] << ",";
	cout << endl;
	return 0;
}