Cod sursa(job #1795670)
Utilizator | Data | 2 noiembrie 2016 19:39:02 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <stdio.h>
#define Nmax 500001
using namespace std;
int n;
unsigned long long int v[Nmax];
void sorttare()
{
int ok,aux;
do{
ok=0;
for(int i=1;i<n;i++)
{
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=1;
}
}
}while(ok);
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%llu",&v[i]);
sorttare();
for(int i=1;i<=n;i++)
printf("%llu ",v[i]);
}