Cod sursa(job #2238076)
| Utilizator | Data | 4 septembrie 2018 15:16:14 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
const int N = 500001;
int n,v[N];
void interschimb(int &x, int &y)
{int aux;
aux=x;
x=y;
y=aux;
}
void citire()
{int i;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
}
void afisare()
{int i;
for(i=1;i<=n;i++)
g<<v[i]<<' ';
}
void ordonare()
{int i,j;
for(i=1; i<n; i++)
for(j=i+1; j<=n; j++)
if(v[i]>v[j]) interschimb(v[i],v[j]);
}
int main()
{citire();
ordonare();
afisare();
return 0;
}
