public static void main(String[] args)
{
    int[] a = {47,25,77,11,24,17,73,18};
    QuickSort(a, 0, a.Length - 2, a.Length - 1);
}

public static void QuickSort(int[] array, int start, int end, int pivot)
{
    if (start >= end) return;

    int leftScan = start;
    int rightScan = end;

    while (true)
    {
        while (array[leftScan] < array[pivot])
        {
            leftScan++;
        }

        while (array[pivot] < array[rightScan])
        {
            rightScan--;
        }

        if (leftScan + 1 >= rightScan)
        {
            int temp2 = array[pivot];
            array[pivot] = array[leftScan];
            array[leftScan] = temp2;
            break;
        }
        else
        {
            int temp1 = array[leftScan];
            array[leftScan] = array[rightScan];
            array[rightScan] = temp1;
        }
    }

    QuickSort(array, start, leftScan - 1, leftScan - 1);

    QuickSort(array, leftScan + 1, end, end);
}