代码

#include<bits/stdc++.h>

using namespace std;

#define Insertion_Sort sort

#define MinimumVal 0

void Insertion_Sort(unsigned *a,int n)
{
	int val,address;
	for(;n;n--)
	{
		val=MinimumVal-1;
		for(int i=0;i<n;i++)
			if(val<a[i])
			{
				val=a[i];
				address=i;
			}
		a[address]=a[n-1];
		a[n-1]=val;	
	}
}

评测结果