Cod sursa(job #3135425)
| Utilizator | Data | 3 iunie 2023 07:15:21 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int v[500001],n, minim, poz_min;
int main()
{
fin>>n;
for(int i=0; i<n; i++)
fin>>v[i];
for(int i=0; i<n-1; i++){
minim=v[i];
poz_min=i;
for(int j=i+1; j<n; j++)
{
if(v[j]<minim){ minim=v[j];
poz_min=j;}
}
v[poz_min]=v[i];
v[i]=minim;
}
for(int i=0; i<n; i++)
fout<<v[i]<< " ";
return 0;
}
