Pagini recente » Cod sursa (job #1673473) | Cod sursa (job #1709023) | Cod sursa (job #2229700) | Cod sursa (job #2527206) | Cod sursa (job #2222315)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
void qSort(int v[500000], int st, int dr){
int mijl,maxim,minim,temp;
mijl=v[st+(dr-st)/2];
maxim=dr;minim=st;
do
{
while(v[minim]<mijl) minim++;
while(v[maxim]>mijl) maxim--;
if(minim<=maxim){
temp=v[minim];
v[minim++]=v[maxim];
v[maxim--]=temp;}
}while(minim<=maxim);
if(st<maxim) qSort(v,st,maxim);
if(minim<dr) qSort(v,minim,dr);}
int main(){
int i,n,v[500000];
f>>n;
for(i=0;i<n;i++) f>>v[i];
qSort(v,0,n-1);
for(i=0;i<n;i++,g<<" ") g<<v[i];
return 0;}