using System;

public class Program

{

    public static void Main()

    {

        int[] nums = { 5,-1,2,0,3 };

        QuickSort(nums, 0, nums.Length - 1);

        PrintArray(nums);

    }

    /* This function takes last element as pivot, 

    places the pivot element at its correct 

    position in sorted array, and places all 

    smaller (smaller than pivot) to left of 

    pivot and all greater elements to right 

    of pivot */

    public static int Partition(int[] arr, int low, int high) 

    { 

        int pivot = arr[high];  

        // index of smaller element 

        int i = (low - 1);  

        for (int j = low; j < high; j++) 

        { 

            // If current element is smaller  

            // than the pivot 

            if (arr[j] < pivot) 

            { 

                i++; 

                Swap(arr, i, j);

            } 

        } 

        Swap(arr, i + 1, high);

        return i + 1; 

    }

    /* The main function that implements QuickSort() 

    arr[] --> Array to be sorted, 

    low --> Starting index, 

    high --> Ending index */

    public static void QuickSort(int[] arr, int low, int high) 

    { 

        if (low < high) 

        { 

            /* pi is partitioning index, arr[pi] is  

            now at right place */

            int pi = Partition(arr, low, high); 

            // Recursively sort elements before 

            // partition and after partition 

            QuickSort(arr, low, pi-1); 

            QuickSort(arr, pi+1, high); 

        } 

    } 

    public static void Swap(int[] arr, int i, int j)

    {

        int temp = arr[i];

        arr[i] = arr[j];

        arr[j] = temp;

    }

    public static void PrintArray(int[] arr) {

        int n = arr.Length;

        for (int i = 0; i < arr.Length; i++)

            Console.Write(arr[i] + " ");

        Console.Write("\n");

    }

}