Pagini recente » Cod sursa (job #3278532) | Cod sursa (job #3223731) | Clasament test_practic_pa_1 | Cod sursa (job #1201129) | Cod sursa (job #2414845)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
int v[100000];
void read()
{
in >> n;
for (int i = 1; i <= n; i++)
{
in >> v[i];
}
}
void swapp(int x, int y)
{
int temp = v[x];
v[x] = v[y];
v[y] = temp;
}
void outVct()
{
for (int i = 1; i <= n; i++) cout << v[i] << " ";
cout << '\n';
}
void sort1()
{
int max = 0;
int nr = 0;
int pointer = 0;
for (int i = 1; i <= n; i++)
{
for (int i = 1; i <= n - nr; i++)
if (v[i] > max) {
max = v[i]; pointer = i;
}
swapp(pointer,n-nr);
nr++;
max = 0;
}
}
int main()
{
read();
sort1();
for (int i = 1; i <= n; i++) out << v[i] << " ";
}