Cod sursa(job #1171391)
Utilizator | Data | 15 aprilie 2014 17:31:42 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <cstdio>
using namespace std;
int i, j, n, v[500005];
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
scanf("%d", &n);
for(i=1;i<=n;i++)
scanf("%d", &v[i]);
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j])
{
v[i]+=v[j];
v[j]=v[i]-v[j];
v[i]-=v[j];
}
for(i=1;i<=n;i++)
printf("%d ", v[i]);
return 0;
}