//QuickSort: in this version the rightmost element as pivot public class QuickSort { public static void main(String[] args) { int[] arr = {4, 5, 1, 2, 3, 3}; quickSort(arr, 0, arr.length-1); System.out.println(Arrays.toString(arr)); } public static void quickSort(int[] arr, int start, int end){ int partition = partition(arr, start, end); if(partition-1>start) { quickSort(arr, start, partition - 1); } if(partition+1