排序算法之插入排序

插入排序算法

#include <iostream>

using namespace std;

/*直接插入排序*/
void InsertSort(int *list,int length)
{
	int insertNum;
	for (int i = 0; i < length; ++i)
	{
		insertNum = list[i];
		int j = i;
		while (j > 0 && insertNum < list[j - 1])
		{
			list[j] = list[j - 1];
			j--;
		}
		list[j] = insertNum;
	}
}

/*输出数组*/
void printlist(int *list, int length)
{
	for (int i = 0; i < length; ++i)
	{
		cout << list[i] << "   ";
	}
	cout << endl;
}
int main()
{
	int list[10] = {1,7,3,5,2,8};
	printlist(list, 6);
	InsertSort(list, 6);
	printlist(list, 6);


	return 0;
}