using System;

public class Program

{

    public static int partition(int[] arr, int left, int right) {

        int pivot;

        pivot = arr[left];

        while (true) {

            while (arr[left] < pivot) {

                left++;

            }

            while (arr[right] > pivot) {

                right--;

            }

            if (left < right) {

                int temp = arr[right];

                arr[right] = arr[left];

                arr[left] = temp;

                print(arr);

            } else {

                return right;

            }

        }

    }

    public static void quickSort(int[] arr, int left, int right) {

        int pivot;

        if (left < right) {

            pivot = partition(arr, left, right);

            if (pivot > 1) {

                quickSort(arr, left, pivot - 1);

            }  

            if (pivot + 1 < right) {

                quickSort(arr, pivot + 1, right);

            }

        }

    }

    public static void print(int[] arr) {

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

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

        }

        Console.WriteLine();

    }

​

    public static void Main()

    {

        int[] arr = {67, 12, 95, 56, 85, 1, 100, 23, 60, 9};

        print(arr);

        quickSort(arr, 0, arr.Length - 1);

    }

}