Cod sursa(job #1448106)
Utilizator | Data | 6 iunie 2015 11:42:10 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ ifstream f("algsort.in");
ofstream g("algsort.out");
int *v,n,i,j,aux,m;
f>>n;
v=new int[n];
for(i=0;i<n;i++)
f>>v[i];
for(i=0;i<n;i++)
{
m=i;
for(j=i+1;j<n;j++)
if(v[j]<v[m]) m=j;
aux=v[i];
v[i]=v[m];
v[m]=aux;
}
for(i=0;i<n;i++)
g<<v[i]<<" ";
return 0;
}