comparisoncountingsort.cpp

计数排序

#include<iostream>
using namespace std;
int n;
int *s=new int[n];
int *ComparisonCountingSort(int a[])
{
	int *Count=new int[n];
	for(int i=0;i<n;i++)
		Count[i]=0;
	for(int j=0;j<n-1;j++)
	{
		for(int k=j+1;k<n;k++)
			if(a[j]<a[k])
				Count[k]=Count[k]+1;
			else
				Count[j]=Count[j]+1;
	}
		for(int i=0;i<n;i++)
			s[Count[i]]=a[i];
		return s;
}
int main()
{
	int	number;
	cout<<"请输入数组的大小"<<endl;
	cin>>n;
	int *a=new int[n];
	cout<<"请输入要排序的数字"<<endl;
	for(int i=0;i<n;i++)
	{
		cin>>number;
	    a[i]=number;
	}
	int *S=ComparisonCountingSort(a);
	for(int i=0;i<n;i++)
		cout<<S[i]<<"  ";
	return 0;
}