Pagini recente » Cod sursa (job #1976069) | Cod sursa (job #1364918) | Cod sursa (job #1573389) | Cod sursa (job #2941874) | Cod sursa (job #2914189)
#include <fstream>
#define N_max 500001
using namespace std;
ifstream cin ("algsort.in");
ofstream cout ("algsort.out");
long long v[N_max];
int n;
void QuickSort(int l,int r)
{
int i=l,j=r,piv=v[(l+r)/2];
while(i<=j)
{
while(v[i]<piv) ++i;
while(v[j]>piv) --j;
if(i<=j) swap(v[i],v[j]),++i,--j;
}
if(i<r) QuickSort(i,r);
if(j>l) QuickSort(l,j);
}
int main()
{
cin>>n;
for(int i=1;i<=n;++i) cin>>v[i];
QuickSort(1,n);
for(int i=1;i<=n;++i) cout<<v[i]<<" ";
return 0;
}