Cod sursa(job #847962)
| Utilizator | Data | 4 ianuarie 2013 17:58:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream is("algsort.in");
ofstream os("algsort.out");
int main()
{
int n,a[500001],aux;
is>>n;
for(int i=0;i<n;i++)
is>>a[i];
for(int i=0;i<n-1;i++)
for(int j=i+1;j<n;j++)
if(a[i]>a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(int i=0;i<n;i++) os<<a[i]<<" ";
is.close();
os.close();
return 0;
}
