Cod sursa(job #686953)
Utilizator | Data | 21 februarie 2012 23:18:39 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream.h>
#include <fstream.h>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i,n,j,a[500001],x;
int main ()
{
f>>n;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=n-1;i++)
for (j=i+1;j<=n;j++)
if (a[i]>a[j])
{
x=a[i];
a[i]=a[j];
a[j]=x;
}
for (i=1;i<=n;i++)
g<<a[i]<<" ";
}