Cod sursa(job #703033)
| Utilizator | Data | 2 martie 2012 10:35:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main ()
{
int N,i,j,a[500],aux;
f>>N;
for(i=1;i<=N;i++)
f>>a[i];
for(i=1;i<N;i++)
for(j=i+1;j<=N;j++)
if(a[i]>a[j])
{aux=a[i];
a[i]=a[j];
a[j]=aux;
}
f.close();
for(i=1;i<=N;i++)
g<<a[i]<<" ";
g.close();
return 0;
}
