static void hannoi(int n, String from, String buffer, String to) {
    if (n == 1) {
        System.out.println("Move disk " + n + " from " + from + " to " + to);
    } else {
        hannoi(n - 1, from, to, buffer);
        System.out.println("Move disk " + n + " from " + from + " to " + to);
        hannoi(n - 1, buffer, from, to);
    }
}

public static void main(String[] args) {
    hannoi(3, "A", "B", "C");
}

public class QuickSort {

    static int[] arr;

    private static void swap(int x, int y) {
        int temp = arr[x];
        arr[x] = arr[y];
        arr[y] = temp;
    }

    private static void quick_sort_recursive(int start, int end) {
        if (start >= end)
            return;
        int mid = arr[end];
        int left = start, right = end - 1;
        while (left < right) {
            while (arr[left] < mid && left < right)
                left++;
            while (arr[right] >= mid && left < right)
                right--;
            swap(left, right);
        }
        if (arr[left] >= arr[end]) {
            swap(left, end);
        } else {
            left++;
        }
        quick_sort_recursive(start, left - 1);
        quick_sort_recursive(left + 1, end);
    }

    public static void sort(int[] arrin) {
        arr = arrin;
        quick_sort_recursive(0, arr.length - 1);
    }

    public static void main(String[] args) {
        int[] array = {1, 5, 3, 2};
        sort(array);
        for (int i = 0; i < array.length; i++) {
            int sortedElement = array[i];
            System.out.println(sortedElement);
        }
    }
}