Pagini recente » Cod sursa (job #3278533) | Cod sursa (job #1042794) | Cod sursa (job #649288) | Cod sursa (job #3225389) | Cod sursa (job #2414834)
#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 sort1()
{
int max = 10000000;
int nr = 0;
for (int i = 1; i <= n; i++)
{
for (int i = 1; i <= n - nr; i++)
if (v[i] > max) max = i;
swapp(i,n-nr);
nr++;
}
}
int main()
{
read();
sort1();
for (int i = 1; i <= n; i++) out << v[i];
}