Cod sursa(job #2190329)
Utilizator | Data | 30 martie 2018 16:18:01 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <iostream>
using namespace std;
int main()
{
int N,v[50001],i,aux=0,sortat=1;
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>N;
for(i=1;i<=N;i++){
f>>v[i];
}
while(sortat==1){
sortat=0;
for(i=1;i<N;i++){
if(v[i]> v[i+1]){
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
sortat=1;
}
}
}
for(i=1;i<=N;i++)
g<<v[i]<<" ";
return 0;
}