Cod sursa(job #277974)
| Utilizator | Data | 11 martie 2009 23:51:02 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
#define MAX 500001
int v[MAX], n;
int main()
{
int i, ok, aux;
FILE *fi=fopen("algsort.in", "r"), *fo;
fscanf(fi, "%d", &n);
for(i=1; i<=n; i++)
fscanf(fi, "%d", &v[i]);
do
{
ok=0;
for(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);
fclose(fi);
fo=fopen("algsort.out", "w");
for(i=1; i<=n; i++) fprintf(fo, "%d ", v[i]);
fclose(fo);
return 0;
}