Cod sursa(job #814007)
| Utilizator | Data | 15 noiembrie 2012 19:47:08 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include<algorithm>
#include<fstream>
#define NMAX 500000
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int v[NMAX],n;
int main (void)
{
in>>n;
for(int i=0;i<n;++i)
in>>v[i];
in.close();
//Bubble Sort
int t,a;
t=0;
while(t==0)
{
t=1;
for(int i=0;i<n-1;++i)
if(v[i]>v[i+1])
{
t=0;
a=v[i];
v[i]=v[i+1];
v[i+1]=a;
}
}
for(int i=0;i<n;++i)
out<<v[i]<<" ";
out.close();
return 0;
}
