#include <iostream>
using namespace std;
int partition(int ar[], int l, int h)
{
    int i = l, j = h, p = ar[l];
    while (i < j)
    {
        do
        {
            i++;
        } while (p > ar[i]);
        do
        {
            j--;
        } while (p < ar[j]);
        if (i < j)
        {
            int t = ar[i];
            ar[i] = ar[j];
            ar[j] = t;
        }
    }
    int tt = ar[j];
    ar[j] = p;
    ar[l] = tt;
    return j;
}
void quicksort(int ar[], int l, int h)
{
    if (l < h)
    {

        int mid = partition(ar, l, h);
        quicksort(ar, l, mid);
        quicksort(ar, mid + 1, h);
    }
}

int main()
{
    //logic na bujle Youtube e giye QuickSort likhe Abdul Bari likhle chole asbe then code dekhle buje jabi!
    int ar[7] = {4, 3, 2, 1, 0, 10, 11};
    int n = sizeof(ar) / sizeof(ar[0]);
    quicksort(ar, 0, n);
    for (int i = 0; i < n; i++)
    {
        /* code */
        std::cout << ar[i] << std::endl;
    }
}