Cod sursa(job #1283088)
| Utilizator | Data | 5 decembrie 2014 02:04:41 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
//Deresu Roberto - FMI
//Re :)
#include<fstream>
#define nx 500007
using namespace std;
int n,a[nx];
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>a[i];
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
if(a[i]>a[j]) a[i] = a[i]^a[j]^(a[j]=a[i]);
for(int i=1;i<=n;i++)
fout<<a[i]<<" ";
return 0;
}
