Pagini recente » Cod sursa (job #1144183) | Cod sursa (job #2476641) | Cod sursa (job #358825) | Cod sursa (job #2977024) | Cod sursa (job #1098967)
#include <iostream>
#include <fstream>
#define nmax 500005
using namespace std;
int n, v[nmax], aux, cnt = 0;
bool sortat = false;
int main() {
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(int i=1; i<=n; i++) f>>v[i];
while(sortat == false) {
sortat = true;
for(int i=1; i<n; i++) {
if(v[i] > v[i+1]) {
sortat = false;
aux = v[i];
v[i] = v[i+1];
v[i+1] = aux;
}
}
}
for(int i=1; i<=n; i++) g<<v[i]<<" "; g<<"\n";
return 0;
}