counting sort.cpp

来自「经典算法实现」· C++ 代码 · 共 35 行

#include "Sort.h"

void CountSort(){
	
	int assit[LARGEST+1];// = new int [LARGEST+1];
	int *outp = new int [num];
	for (int i=0;i<LARGEST+1;i++)
	{
		assit[i]=0;
	}

	for (int i=0;i<num;i++)
	{
		assit[arr[i]]++;
	}

	for (int i=1;i<LARGEST+1;i++)
	{
		assit[i]+= assit[i-1];
	}

	for (int i=num-1;i>=0;i--)
	{
		outp[ --assit[ arr[i] ] ] = arr[i];
	}

	for (int i = 0;i<num;i++)
	{
		arr[i]=outp[i];
	}

	delete []outp;


}