Cod sursa(job #2591800)
Utilizator | Prizlopan Iustin George PrizlopanIustin | Data | 31 martie 2020 12:46:24 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 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[10],y=1,z=1,sortat;
int main()
{
ifstream in("algsort.in");
ofstream out("algsort.out");
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
sortat=0;
while(sortat==0)
{
sortat=1;
for(i=1;i<n;i++)
{
if(v[i]>v[i+1])
{
sortat=0;
swap(v[i],v[i+1]);
break;
}
}
}
for(i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}