Cod sursa(job #1259587)
Utilizator | Data | 10 noiembrie 2014 10:56:58 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int main ()
{int n,v[50001],i,c,ko=1;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
}
do
{ko=1;
for(i=1;i<=n;i++)
{
if(v[i]>v[i+1])
{
c=v[i+1];
v[i+1]=v[i];
v[i]=c;
ko=0;
}
} }while(ko==0);
for(i=1;i<=n;i++)
{
out<<v[i];
out<<" ";
}
return 1;
}