Cod sursa(job #1422957)
Utilizator | Data | 20 aprilie 2015 15:30:52 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <stdio.h>
using namespace std;
FILE*f=fopen("algsort.in","r"),*g=fopen("algsort.out","w");
int n, v[500100];
int main()
{
fscanf(f,"%d ",&n);
for(int i = 1; i <= n; i++)
fscanf(f,"%d ",&v[i]);
for(int i = 1; i <= n; i++)
{
for(int j = i+1; j <= n; j++)
{
if(v[i] > v[j])
{
int aux = v[i];
v[i] = v[j];
v[j] = aux;
}
}
}
for(int i = 1; i <= n; i++)
fprintf(g,"%d ",v[i]);
return 0;
}