插入排序伪代码及实现

方法一

//插入排序实现

#include <iostream>
using namespace std;

void insert_sort(int A[],unsigned int first,unsigned int last)//一般是first为零，last为n - 1
{
	unsigned int i,j;
	int temp;
	for (i = first + 1;i <= last;i++)
	{
		temp = A[i];
		j = i - 1;
		//与已排序元素逐一比较大小，大于temp时，该元素后移
		while ((j >= first) && (A[j] > temp))
		{
			A[j + 1] = A[j];
			j--;
		}
		//被排序数放到正确的位置
		A[j + 1] = temp;
	}
}

void Print(int B[],unsigned int n)
{
	for (unsigned int i = 0;i < n;i++)
		cout << B[i] << " " ;
	cout << endl;
}

int main()
{
	unsigned int length_A;
	cin >> length_A;

	int *a = new int[length_A];
	for (int i = 0;i < length_A;i++)
		a[i] = rand() % 100;

	Print(a,length_A);
	insert_sort(a,0,length_A - 1);
	Print(a,length_A);

	delete []a;

	return 0;
}

方法二：