Cod sursa(job #1259085)
| Utilizator | Data | 9 noiembrie 2014 18:12:34 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
void selsort(int v[500000], int n) {
int i,minim,j,a;
for (i=0;i<n-1;i++) {
minim = i;
for (j=i+1;j<n;j++)
if (v[j] < v[minim]) minim = j;
if (minim != i) {
a = v[i];
v[i] = v[minim];
v[minim] = a;
}
}
}
int main()
{
int v[500000],i,n;
ifstream f("algsort.in");
f>>n;
for (i=0;i<n;i++) f>>v[i];
f.close();
selsort(v,n);
ofstream g("algsort.out");
for (i=0;i<n;i++) g<<v[i];
return 0;
}
