using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace quick_sort
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] array = { 3, 4, 2, 1, 0, 5, 32, 5, 23 };
            quicksort(array, 0, array.Length - 1);
            foreach (var e in array)
                Console.WriteLine(e);
            Console.ReadKey();
        }

        static int partition(int[] array,  int start, int end)
        {
            int temp, marker = start;
            for (int i = start; i < end; i++)
                if (array[i] < array[end])
                {
                    temp = array[marker];
                    array[marker] = array[i];
                    array[i] = temp;
                    marker++;
                }
            temp = array[marker];
            array[marker] = array[end];
            array[end] = temp;
            return marker;
        }

        static void quicksort(int[] array, int start, int end)
        {
            if (start >= end)
                return;
            int pivot = partition(array, start, end);
            quicksort(array, start, pivot - 1);
            quicksort(array, pivot + 1, end);
        }
    }
}