Pagini recente » Cod sursa (job #2180671) | Cod sursa (job #2209007) | Cod sursa (job #1326170) | Cod sursa (job #1790380) | Cod sursa (job #1516080)
#include<iostream>
#include<fstream>
#include<stdio.h>
using namespace std;
double n,t;
int ok,i;
double v[500001];
int main() {
ifstream f("algsort.in");
ofstream g("algsort.out");
f >> n;
for (i = 1; i <= n; i++)
f >> v[i];
do {
ok = 1;
for (i = 1; i <= n-1;i++)
if (v[i] > v[i + 1])
{
t = v[i];
v[i] = v[i + 1];
v[i + 1] = t;
ok = 0;
}
} while (ok == 0);
for (i = 1; i <= n; i++)
g <<' '<< v[i];
return 0;
}