Cod sursa(job #2237799)
Utilizator | Data | 3 septembrie 2018 09:40:55 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int v[15],i,ok,n,x;
fin>>n;
for(i=0;i<n;i++)
fin>>v[i];
do{
ok=0;
for(i=0;i<n-1;i++)
if(v[i]>v[i+1])
{
x=v[i];
v[i]=v[i+1];
v[i+1]=x;
ok=1;
}
}while(ok==1);
for(i=0;i<n;i++)
fout <<v[i]<<" ";
fin.close();
fout.close();
return 0;
}