private static void Quick_Sort(int[] arr, int left, int right)
int pivot = Partition(arr, left, right);
Quick_Sort(arr, left, pivot - 1);
Quick_Sort(arr, pivot + 1, right);
private static int Partition(int[] arr, int left, int right)
while (arr[left] < pivot)
while (arr[right] > pivot)
if (arr[left] == arr[right]) return right;
public static void Main()
int[] arr = new int[] { 2, 5, -4, 11, 0, 18, 22, 67, 51, 6 };
Console.WriteLine("Original array : ");
foreach (var item in arr)
Console.Write(" " + item);
Quick_Sort(arr, 0, arr.Length-1);
Console.WriteLine("Sorted array : ");
foreach (var item in arr)
Console.Write(" " + item);