Pagini recente » Cod sursa (job #1193196) | Cod sursa (job #2741523) | Cod sursa (job #2561354) | Cod sursa (job #1227710) | Cod sursa (job #1021505)
#include<iostream>
#include<fstream>
using namespace std;
#define nr 500000
void sort(long V[], long n){
int buckets[nr];
for (int i = 0; i < nr; i++){
buckets[i] = 0;
}
for (int i = 0; i < n; i++){
++buckets[V[i]];
}
for (int i = 0, j=0; j < nr; j++){
for (int k = buckets[j]; k >0; k--){
V[i++] = j;
}
}
}
int main(){
long V[500000];
ifstream f("algsort.in");
long n = 0;
f >> n;
for (long i = 0; i < n; i++){
f >> V[i];
}
sort(V, n);
ofstream o("algsort.out");
for (long i = 0; i < n; i++){
o << V[i] << " ";
}
o << '\n';
return 0;
}