Cod sursa(job #2100497)
Utilizator | Iustinian Petrariu IustinPetrariu | Data | 5 ianuarie 2018 18:46:51 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[11];
int main()
{
fin>>n;
for(int i =1 ; i <=n ; i++)
fin>>v[i];
int ok,aux;
do
{
ok=1;
for(int i= 1; i < n ; i++)
if(v[i] > v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=0;
}
}while(ok!=1);
for(int i =1 ; i <= n ; i++)
fout<<v[i];
return 0;
}