Cod sursa(job #797729)
Utilizator | skyper skyper96 | Data | 14 octombrie 2012 18:37:16 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int a[499999],j,min,i,aux;
long n;
f>>n;
for(i=0;i<n;i++)
f>>a[i];
for(j=0;j<n-1;j++)
{
min=j;
for(i=j+1;i<n;i++)
{
if(a[i]<a[min])
min=i;
}
if(min!=j)
{
aux=a[j];
a[j]=a[min];
a[min]=aux;
}
g<<a[j]<<" ";
}
f.close();
g.close();
return 0;
}