计数排序

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;


int CountingSort(vector<int>& Array, vector<int>& Brray, int k);


int main(){
int Temp;
ifstream infile("input.txt");
vector<int> Array;
while(infile>>Temp){
Array.push_back(Temp);
}
vector<int> Brray=Array;
int k=*(Array.begin());
for(vector<int>::iterator it=Array.begin();it!=Array.end();it++){
if(k<=*it){
k=*it;
}
}
CountingSort(Array,Brray,k);
for(vector<int>::iterator it=Brray.begin();it!=Brray.end();it++){
cout<<*it<<endl;
}
}


int CountingSort(vector<int>& Array, vector<int>& Brray, int k){
vector<int> C(k+1);
for(int i=0;i<k+1;i++){
C[i]=0;
}
for(vector<int>::iterator it=Array.begin();it!=Array.end();it++){
C[*it]=C[*it]+1;
}
for(int i=1;i<=k;i++){
C[i]=C[i]+C[i-1];
}
for(vector<int>::iterator it=Array.end()-1;it>Array.begin();it--){
Brray[C[*it]-1]=*it;
C[*it]=C[*it]-1;
}
Brray[C[*Array.begin()]-1]=*Array.begin();
return 0;
}