Pagini recente » Istoria paginii home | Cod sursa (job #12852) | Cod sursa (job #2560131) | Cod sursa (job #842856) | Cod sursa (job #1806705)
#include <iostream>
#include <fstream>
#include <ctime>
#include <cstdlib>
using namespace std;
int a[500005];
ifstream f("algsort.in");
ofstream g("algsort.out");
void Quick(int st,int dr)
{ if (st>=dr) return;
int i, p = (st+dr)/2 ,ind = st-1;
swap(a[p],a[dr]);
for(i=st;i<=dr;i++)
if (a[i]<=a[dr])
{ ind++;
swap(a[ind],a[i]);
}
Quick(st,ind-1);
Quick(ind+1,dr);
}
int main()
{ int n,i;
f>>n;
for(i=1;i<=n;i++)
{ f>>a[i];
rand();
}
Quick(1,n);
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}