Pagini recente » Cod sursa (job #1904698) | Monitorul de evaluare | Cod sursa (job #2039669) | Cod sursa (job #2137832) | Cod sursa (job #1744159)
//#include "stdafx.h"
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
/*int* numbers;
numbers = (int*)calloc(500000, sizeof(int));*/
int numbers[500000];
int main()
{
in >> n;
//cout << n << endl;
/*for (int i = 0; i <= 499999; i++)
numbers[i]=0;*/
for (int i = 0; i <= n - 1; i++)
in >> numbers[i];
/*for (int i = 0; i <= n - 1; i++)
cout << numbers[i] << " ";*/
bool ok = 1;
while (ok)
{
ok = 0;
for (int i = 0; i <= n - 2; i++)
if (numbers[i] > numbers[i + 1])
{
int temp = numbers[i];
numbers[i] = numbers[i + 1];
numbers[i + 1] = temp;
ok = 1;
}
}
for (int i = 0; i <= n - 1; i++)
{
out << numbers[i];
if (i != n - 1)
out << " ";
}
return 0;
}