Pagini recente » Cod sursa (job #1610727) | Cod sursa (job #853683) | Cod sursa (job #1350924) | Cod sursa (job #426995) | Cod sursa (job #2082215)
//Enunt: http://www.infoarena.ro/problema/algsort
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
void Inter(int &x,int &y)
{
int aux=y;
y=x;
x=aux;
}
void BubbleSort(int a[],int n)
{
int k=0;
bool ordo;
do{
ordo=1;
for(int i=0;i<n-k-1;++i)
if(a[i]>a[1+i])
{
ordo=0;
Inter(a[1+i],a[i]);
}
++k;
}while(!ordo);
}
int main()
{
int N;
in>>N;
int v[N];
for(int i=0;i<N;++i)
in>>v[i];
BubbleSort(v,N);
for(int i=0;i<N;++i)
out<<v[i]<<' ';
return 0;
}