Cod sursa(job #1015123)
| Utilizator | Data | 23 octombrie 2013 22:05:08 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdlib.h>
#include<fstream>
using namespace std;
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main ()
{ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[1000],i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
qsort (v, n, sizeof(int), compare);
for (i=1;i<=n;i++)
g<<v[i]<<" ";
g<<"\n";
f.close();
g.close();
return 0;
}