#include <iostream>
#define n 11
using namespace std;

int A[n] = {25,12,37,15,20,45,34,3,29,7,32};

void sort(int l, int r);

main()
{
    int i ,kiri,kanan,kali,X;
    cout<<"Sebelum di Sort\n";
    for(i=0; i<=n-1; i++)
        cout<<A[i]<<" ";
    cout<<endl;

    sort(0, n-1);

    cout<<"\nSetelah di Sort\n";
    for(i=0; i<=n-1; i++)
        cout<<A[i]<<" ";
    cout<<endl;
    system("pause");
}

    void sort(int kiri,int kanan)
{
    int i,ii,j,x,pivot,w,k;
    i=kiri;
    j=kanan;
    pivot=A[i];
    //pivot = A[i + (rand() % (j-i + 1))];
    while (i <= j)
}
    {
        while(A[i] < pivot)
        i++;
        while(pivot < A[j])
        j--;
        if(i <= j)
        {
        swap(A[i],A[j]);
        i++;
        j--;
        }

    if(kiri<j)
        sort(kiri,j);
    if(i<kanan)
        sort(i,kanan);
}