Cod sursa(job #958291)
| Utilizator | Data | 7 iunie 2013 15:13:57 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#define p 500000
using namespace std;
int n, i, aux, a[p];
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int main()
{
cin>>n;
for(i=1; i<=n; i++)
{
cin>>a[i];
}
while(false);
{
for(i=1; i<=n; i++)
if(a[i]>a[i+1])
{aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
}
}
for(i=1; i<=n; i++)
{cout<<a[i]<<" ";
}
cin.close();
cout.close();
return 0;
}
