插入排序

#include<iostream>
using namespace std;
 
void Insert_Sort(int array[], int len)
{//在未排序的数中选举一个数插入已经排好序的数组中
	for (int i = 1; i < len; i++)
	{
		int k = i;
		int tmp = array[k];
		for (int j = i - 1; j >= 0; j--)
		{
			if (array[j] > tmp)
			{
				array[j + 1] = array[j];
				k = j;
			}
			array[k] = tmp;
		}
	}
}
void main()
{
	int a[5];
	for (int i = 0; i < 5; i++)
	{
		cin >> a[i];
	}
	Insert_Sort(a, 5);
	for (int i = 0; i < 5; i++)
	{
		cout << "a[" << i << "]=" << a[i] << endl;
		
	}
	system("pause");
}