Cod sursa(job #241466)
| Utilizator | Data | 10 ianuarie 2009 08:48:03 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int a[500009];
void bubblesort(int n){
bool ok=1;
int i=1;
while(ok){
ok=0;
while(i<n){
if(a[i]<a[i-1]){
swap(a[i],a[i-1]);
ok=1;
}
i++;
}
}
}
int main(){
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i;
f>>n;
for(i=0;i<n;i++)
f>>a[i];
f.close();
bubblesort(n);
for(i=0;i<n;i++)
g<<a[i]<<' ';
g<<'\n';
g.close();
return 0;
}
