Pagini recente » Cod sursa (job #359064) | Cod sursa (job #2799202) | Cod sursa (job #2783369) | Cod sursa (job #2898973) | Cod sursa (job #1889106)
#include <fstream>
#include <vector>
using namespace std;
vector <int> a;
void read()
{
int n;
ifstream f("algsort.in");
f >> n;
a.resize(n);
for (int i = 0; i < a.size(); i++)
f >> a[i];
f.close();
}
void qs(int l, int r)
{
int i = l, j = r, q = a[ (i + j) / 2];
while (i < j)
{
while (a[i] < q) i++;
while (a[j] > q) j--;
if (i<=j)
{
swap(a[i], a[j]);
i++; j--;
}
}
if (i < r) qs(i, r);
if (l < j) qs(l, j);
}
void write()
{
ofstream f("algsort.out");
for (int i = 0; i < a.size(); i++)
f << a[i] << ' ';
f.close();
}
int main()
{
read();
qs(0, a.size()-1 );
write();
return 0;
}