Mai intai trebuie sa te autentifici.
Cod sursa(job #1017301)
| Utilizator | Data | 27 octombrie 2013 17:12:23 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include<stdio.h>
int main()
{
int n, a[100], i, j, k, man, min;
FILE *f,*g;
f=fopen("algsort.in","r");
g=fopen("algsort.out","w");
fscanf(f,"%d",&n);
for (i=0;i<n;i++)
{
fscanf(f,"%d",&a[i]);
}
for (i=0;i<n-1;i++){
min=a[i];
k=i;
for (j=i+1;j<n;j++)
if (a[j]<min)
{
min=a[j];
k=j;
}
man=a[k];
a[k]=a[i];
a[i]=man;
}
for (i=0;i<n;i++)
fprintf(g,"%d ",a[i]);
return 0;
}
