Cod sursa(job #2000900)
Utilizator | Data | 14 iulie 2017 23:58:39 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int i,j,v[100],n,ok=0,aux;
int main()
{
in>>n;
for(i=0;i<n;i++)
in>>v[i];
do{
ok=1;
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(v[i]>v[j])
{
aux=v[i];
v[i]=v[j];
v[j]=aux;
ok=0;
}
}while(ok==0);
for(i=0;i<n;i++)
out<<v[i]<<" ";
}