Slow Sort SlowSort is an example of MultiplyAndSurrender - a worst possible sort algorithm: We can decompose the problem of sorting n numbers in ascending order into (1) finding the maximum of those numbers, and (2) sorting the remaining ones. Subproblem (1) can be further decomposed into (1.1) find the maximum of the first n/2 elements, (1.2) find the maximum of the remaining n/2 elements, and (1.3) find the largest of those two maxima. Finally, subproblems (1.1) and (1.2) can be solved by sorting the specified elements and taking the last element in the result. We have thus multiplied the original problem into three slightly simpler ones (sort the first half, sort the second half, sort all elements but one), plus some overhead processing. We continue doing this recursively until the lists have at most one element each, at which point we are forced to surrender. From "Pessima...