Cod sursa(job #785910)
| Utilizator | Data | 10 septembrie 2012 10:05:25 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
long long v[500001];
int main(){
long long n,i,gasit,aux;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
do{
gasit=0;
for(i=1;i<n;i++)
if(v[i]>v[i+1]){
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
gasit=1;
}
}while(gasit==1);
for(i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}