Cod sursa(job #535842)
Utilizator | Data | 17 februarie 2011 20:26:02 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{long n, i, j, aux, x[100];
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(x[i]<x[j])
{aux=x[i];
x[i]=x[j];
x[j]=aux;}
for(i=1;i<=n;i++)
g<<x[i];
return 0;
}