Cod sursa(job #1004722)
Utilizator | Data | 3 octombrie 2013 16:25:59 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n, v[500001], i, aux, k, j;
int main(){
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
do {
k=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;
k=1;
}
} while (k==1);
for(j=1; j<=n; j++)
fout<<v[j]<<" ";
return 0;
}