How to write quick sort in JAVA

An implementation of Java quick sort is as follows: public class QuickSort { public static void sort(int[] arr, int left, int right) { int index = partition(arr, left, right); if (left < index - 1) { sort(arr, left, index - 1); } if (index < right) { sort(arr, index