Cod sursa(job #795658)
| Utilizator | Data | 9 octombrie 2012 11:18:45 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
#define NMAX 500005
int n,A[NMAX];
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
int i,j,best_poz,aux;
for (i=1; i<=n; i++)
scanf("%d",&A[i]);
for (i=1; i<n; i++)
{
best_poz=i;
for (j=i+1; j<=n; j++)
if (A[j]<A[best_poz])
best_poz=j;
if (best_poz!=i)
aux=A[i],A[i]=A[best_poz],A[best_poz]=aux;
}
for (i=1; i<=n; i++)
printf("%d ",A[i]);
printf("\n");
return 0;
}
