quickSortAlgo(arrayTobeSorted, start, pivot - 1); Quicksort uses recursive method (quicksort java recursive) that calls itself. array[i + 1] = array[end]; Like QuickSort, MergeSort is the Divide and Conquer algorithm. Program: Implement quick sort in java. Quick Sort algorithm can be implemented in Java by forming a pseudo code with a sequence of steps designed and followed in an efficient manner. The efficiency of quick sort algorithms comes down in the case of a greater number of repeated elements which is a drawback. quick-sort-java quick sort algorithm in java About quick sort : (wikipedia)Quicksort (sometimes called partition-exchange sort) is an O(n log n) efficient sorting algorithm, serving as a systematic method for placing the elements of a random access file or an array in order. Code: