Cod sursa(job #1081421)
| Utilizator | Data | 13 ianuarie 2014 17:02:20 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#define Max 500004
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int v[Max],n;
int bubblesort(int v[Max])
{
int i,s,aux;
do
{
s=0;
for(i=0; i<n; i++)
if(v[i]>v[i+1]){
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
s=1;
}
}
while(s==1);
return 0;
}
int main()
{
int i;
cin>>n;
for(i=0; i<n; i++)
cin>>v[i];
bubblesort(v);
for(i=0; i<n; i++)
cout<<v[i]<<' ';
return 0;
}
