quick sort with arrays

quickSort.java

package sorting;

public class QuickSortWithArray {
    public static void main(String[] args) {
        int[] arrs = new int[10];

        for (int i = 0; i < 10; i++) {
            arrs[i] = (int) (Math.random() * 100);
        }

        printArray(arrs);
        System.out.println();

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

        printArray(arrs);
    }

    private static int[] quickSort(int[] arrays, int low, int high) {
        if (arrays.length <= 0) {
            return arrays;
        }
        if (low >= high) {
            return arrays;
        }

        int lowboundry = low;
        int highboundry = high;

        int pivot = arrays[low];
        while (low < high) {
            while (low < high && arrays[high] >= pivot) {
                high--;
            }
            arrays[low] = arrays[high];
            while (low < high && arrays[low] <= pivot) {
                low++;
            }
            arrays[high] = arrays[low];
        }

        arrays[low] = pivot;
        printArray(arrays);
        System.out.println();

        quickSort(arrays, lowboundry, low);
        quickSort(arrays, low + 1, highboundry);

        return arrays;
    }

    private static boolean isOutIndexOfBoundary(int index, int[] arrs) {
        return (index < 0 || index > arrs.length - 1);
    }

    private static void printArray(int[] arrs) {
        for (int i = 0; i < arrs.length; i++) {
            System.out.print(arrs[i] + " ");
        }
    }
}