Cod sursa(job #2591848)
Utilizator | Prizlopan Iustin George PrizlopanIustin | Data | 31 martie 2020 15:30:39 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
long long i,n,p,x,d,ok,s=1,j,maxi,r=1,v[500001],k[500001],y=1,z=1,sortat,loc,mini;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
for(i=1;i<n;i++)
{
mini=v[i];
loc=i;
for(j=i+1;j<=n;j++)
{
if(mini>v[j])
{
mini=v[j];
loc=j;
}
}
swap(v[i],v[loc]);
}
for(i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}