The Quicksort algorithm was developed in 1960 by Tony Hoare?. It is a divide-and-conquer approach in which the array is repeatedly partitioned into two sub-arrays and then those are themselves sorted by Quicksort. A recursive specification of the algorithm is: 3.1.1 Insert 3.1.2 Remove 3.2 Heapify 3.2.1 Top-Down Heapify 3.2.2 Bottom-Up Heapify quicksort (in/out)array, left_index, right_index): if left index