Slowsort is an in-place, stable sorting algorithm developed by Andrei
Broder and Jorge Stolfi. It is a reluctant algorithm based on the
principle of multiply and surrender. (Broder and Stolfi)
Steps in Algorithm
A brief description of the algorithm is as follows:
Sort the first half, recursively
Sort the second half, recursively
Find maximum of whole array by comparing results of steps 1 and 2,
and place it at the end of the list.
Sort the whole entire list, sans the element removed in step 3, recursively.
