public class QuickSort { public static void quicksort(int[] arr, int left, int right) { if (right <= left) return; int pivot = arr[left]; int index = left+1; for(int i=left+1; i<=right; ++i) { if(arr[i]