Cod sursa(job #1946060)
Utilizator | Data | 29 martie 2017 21:10:49 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("algosort.in");
ofstream out("algosort.out");
int n, a[50],i,j,aux;
in>>n;
for (i=1; i<=n; i++){
in>>a[i];
}
for ( i=1; i<n; i++){
for(j=1; j<n; j++){
if ( a[j]>a[j+1]){
aux=a[j];
a[j]=a[j+1];
a[j+1]=aux;
}
}
}
for ( i=1; i<=n; i++){
out<<a[i]<<" ";
}
return 0;
}