Pagini recente » Cod sursa (job #2527964) | Cod sursa (job #549261) | Cod sursa (job #1199645) | Cod sursa (job #949084) | Cod sursa (job #1501233)
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int n,v[500001],sortat,t;
void sortat1(int st,int dr)
{
int i=st,j=dr,x=v[(i+j)/2];
do
{while(v[j]>x)j--;
while(v[i]<x)i++;
if(i<=j)
{t=v[i],v[i]=v[j],v[j]=t;
i++;j--;}
}while(i<=j);
if(j>st)sortat1(st,j);
if(i<dr)sortat1(i,dr);
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
sortat1(1,n);
for(int i=1;i<=n;i++)
out<<v[i]<<" ";
return 0;
}