Pagini recente » Cod sursa (job #2664847) | Cod sursa (job #1421042) | Cod sursa (job #2543658) | Cod sursa (job #3202471) | Cod sursa (job #2428215)
#include <iostream>
#include <fstream>
#define DIMMAX 500001
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[DIMMAX];
int verifsort(int v[DIMMAX], int n)
{
int i;
for (i = 1; i < n; i++)
if (v[i] > v[i+1])
return 0;
return 1;
}
int pozmin(int v[DIMMAX], int a, int b)
{
int i, Min = v[a], pozmin = a;
for (i = a + 1; i <= b; i++)
if (v[i] < Min)
{
Min = v[i];
pozmin = i;
}
return pozmin;
}
void intsch(int v[DIMMAX], int a, int b)
{
int i,aux;
for (i = a; i < a+(b-a+1)/2; i++)
{
aux = v[i];
v[i] = v[b-i+a];
v[b-i+a] = aux;
}
}
int main()
{
int n, i = 1, poz;
fin>>n;
while (!fin.eof())
{
fin>>v[i];
i++;
}
i = 1;
while (!verifsort(v, n))
{
poz = pozmin(v, i, n);
intsch(v, poz, n);
intsch(v, i, n);
i++;
}
for (i = 1; i <= n; i++)
fout<<v[i]<<" ";
fin.close();
fout.close();
return 0;
}