Pagini recente » Cod sursa (job #17540) | Cod sursa (job #2854143) | Cod sursa (job #283885) | Cod sursa (job #1938469) | Cod sursa (job #2273151)
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int aux,N,a[500005];
void Quicksort(int st, int dr)
{int mid=(st+dr)/2,i,j;
i=st;j=dr;
while(i<=j)
{while(i<=dr&&a[i]<a[mid])i++;
while(j>=st&&a[j]>a[mid])j--;
if(i<=j){aux=a[i];
a[i]=a[j];
a[j]=aux;i++;j--;
}
}
if(st<j)
Quicksort(st,j);
if(dr>i)
Quicksort(i,dr);
}
int main()
{int i;
fin>>N;
for(i=1;i<=N;i++)
fin>>a[i];
Quicksort(1,N);
for(i=1;i<=N;i++)
fout<<a[i]<<" ";
}