Cod sursa(job #721357)
| Utilizator | Data | 23 martie 2012 17:31:11 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int a[100],n,i,j,aux;
fstream f("algsort.in",ios::in);
fstream g("algsort.out",ios::out);
f>>n;
for(i=0;i<n;i++)
f>>a[i];
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=0;i<n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}
