Cod sursa(job #2514586)
Utilizator | Ovidiu-Antonio Matei Ovidiu-Antonio | Data | 26 decembrie 2019 14:33:42 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int N, v[500000], i, s=0, aux;
fin>>N;
for(i=0;i<N;i++)
fin>>v[i];
while(s==0)
{
s=1;
for(i=0;i<N-1;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
s=0;
}
}
for(i=0;i<N;i++)
fout<<v[i]<<" ";
return 0;
}