Cod sursa(job #2172338)
Utilizator | Data | 15 martie 2018 16:07:50 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int i,n,v[500010],p,j;
int main()
{
in>>n;
for(i=1;i<=n;i++) in>>v[i];
for(i=1;i<n;i++)
{
p=i;
for(j=i+1;j<=n;j++) if(v[j]<v[p]) p=j;
swap(v[i],v[p]);
}
for(i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}