Cod sursa(job #509108)
| Utilizator | Data | 10 decembrie 2010 14:34:09 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
//sortare fara "dureri" de cap! ;)
#include <fstream>
#include <stdio.h>
using namespace std;
int main()
{
long a[500002],n,i,j;
ifstream f ("algsort.in");
freopen("algsort.out","w",stdout);
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])
{
a[i]+=a[j];
a[j]=a[i]-a[j];
a[i]=a[i]-a[j];
}
for (i=0;i<n;i++)
printf ("%ld ",a[i]);
}
