Cod sursa(job #531393)
| Utilizator | Data | 9 februarie 2011 16:29:01 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main()
{
int a[500],n,i;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
qsort (a+1,n, sizeof(int),compare);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}