Cod sursa(job #2162369)
Utilizator | Data | 12 martie 2018 10:24:23 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int i, j, n, p, aux, v[500001];
int main()
{
f >> n;
for(int i=1;i<=n;i++)
f >> v[i];
for(int i=1;i<n;i++){
p=i;
for(int j=i+1;j<=n;j++)
if(v[p]>v[j]) p=j;
if(i!=p){
aux=v[i];
v[i]=v[p];
v[p]=aux;
}
}
for(int i=1;i<=n;i++)
g << v[i] << " ";
return 0;
}