Cod sursa(job #894430)
Utilizator | Data | 26 februarie 2013 21:15:16 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int main()
{
fstream f("algsort.in");
fstream g("algsort.out");
int n,i,aux,q=0,gasit=0;
f>>n;
int a[500];
for(i=0;i<n;i++)
f>>a[i];
do{
gasit=0;
for(i=0;i<n-q;i++){
if(a[i]>a[i+1]){
aux=a[i+1];
a[i+1]=a[i];
a[i]=aux;
gasit=1;
}
}
q++;
}while(gasit!=0);
for(i=0;i<n;i++)
g<<a[i]<<" ";
}