Pagini recente » Cod sursa (job #2166706) | Cod sursa (job #2975013) | Cod sursa (job #263253) | Cod sursa (job #727935) | Cod sursa (job #2987458)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{
int n, v[500005];
fin >> n;
for(int i=0; i<n; i++)
fin >> v[i];
bool sortat = 0;
while(sortat == 0)
{
sortat = 1;
for(int i=0; i<n-1; i++)
if (v[i] > v[i+1])
{
int aux = v[i];
v[i] = v[i+1];
v[i+1] = aux;
sortat = 0;
}
}
for(int i=0; i<n; i++)
fout << v[i] << " ";
return 0;
}