---

import java.util.Arrays;

public class Main {

    static int partition(int[] arr, int low, int high) {
        int pivot = arr[high];
        int i = low - 1;

        for (int j = low; j < high; j++) {
            if (arr[j] <= pivot) {
                i++;

                int temp = arr[i];
                arr[i] = arr[j];
                arr[j] = temp;
            }
        }

        int temp = arr[i + 1];
        arr[i + 1] = arr[high];
        arr[high] = temp;

        return i + 1;
    }

    static void quickSort(int[] arr, int low, int high) {
        if (low < high) {
            int p = partition(arr, low, high);

            quickSort(arr, low, p - 1);
            quickSort(arr, p + 1, high);
        }
    }

    public static void main(String[] args) {

        int[][] testCases = {
            {10, 6, 8, 9, 1, 5},
            {3, 3, 3, 3},
            {1, 2, 3, 4, 5},
            {5, 4, 3, 2, 1}
        };

        int[][] correctCases = {
            {1, 5, 6, 8, 9, 10},
            {3, 3, 3, 3},
            {1, 2, 3, 4, 5},
            {1, 2, 3, 4, 5}
        };

        int i = 0;

        for (int[] arr : testCases) {
            System.out.println("До: " + Arrays.toString(arr));

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

            System.out.println("После: " + Arrays.toString(arr));

            if (!Arrays.equals(arr, correctCases[i])) {
                System.out.println("Тест не пройден");
                return;
            }

            System.out.println("Тест пройден");
            ++i;
        }
    }
}