Cod sursa(job #1651161)
| Utilizator | Data | 12 martie 2016 14:38:47 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#define nmax 500005
using namespace std;
int n, v[nmax];
int main() {
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
bool facut_interschimbare = true;
while(facut_interschimbare) {
facut_interschimbare = false;
for(int i=1; i<n; i++) {
if(v[i] > v[i+1]) {
int aux = v[i];
v[i] = v[i+1];
v[i+1] = aux;
facut_interschimbare = true;
}
}
}
for(int i=1; i<=n; i++)
g<<v[i]<<" ";
g<<"\n";
return 0;
}
