Cod sursa(job #1802370)
| Utilizator | Data | 10 noiembrie 2016 10:46:15 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,i,a[500000],aux;
bool gasit=false;
fin>>n;
for(i=1;i<=n;i++){
fin>>a[i];
}
do{
gasit=false;
for(i=1;i<n;i++){
if(a[i] > a[i+1]){
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
gasit=true;
}
}
}while(gasit==true);
for(i=1;i<=n;i++){
fout<<a[i]<<" ";
}
}
