Cod sursa(job #266568)
| Utilizator |  pislaru andrei andy41 |
Data | 25 februarie 2009 20:05:58 |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream.h>
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,j,aux,a[100];
int main()
{f>>n;
for(i=1;i<=n;i++)
f>>v[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;}
for(i=1;i<=n;i++)
g<<a[i]<<' ';
f.close();
g.close();
return 0;}