Pagini recente » Cod sursa (job #485228) | Cod sursa (job #1411107) | Cod sursa (job #885822) | Cod sursa (job #2194228) | Cod sursa (job #3003762)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f1 ("algsort.in");
ofstream f2 ("algsort.out");
int n,i,maxim=-1;
f1>>n;
int v[n];
for (i=0; i<n; i++)
{
f1>>v[i];
if(maxim<v[i])
maxim=v[i];
}
int w[maxim+1]= {0};
for (i=0; i<n; i++)
w[v[i]]++;
for (i=0; i<maxim+1; i++)
while (w[i]!=0)
{
f2<<i<< " ";
w[i]--;
}
return 0;
}