Cod sursa(job #727961)
Utilizator | Data | 28 martie 2012 13:22:34 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int main(){
ifstream f("algsort.in");
ofstream g("algsort.out");
long n,i,a[500001];
int ok;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
do{
ok=1;
for(i=1;i<n;i++)
if(a[i]>a[i+1]){
int aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
ok=0;}}
while(ok==0);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;}