Slowsort

For the other sorting algorithm also known as "slowsort", see Bogosort.

Slowsort is a sorting algorithm. It is of humorous nature and not useful. It is a reluctant algorithm based on the principle of multiply and surrender (a parody formed by taking the opposites of divide and conquer ). It was published in 1984 by Andrei Broder and Jorge Stolfi in their paper "Pessimal Algorithms and Simplexity Analysis" ^[1] (a parody of optimal algorithms and complexity analysis ).

Algorithm

Slowsort is a recursive algorithm.

• It sorts in-place.
• It is an unstable sort. (It might change the order of equal-valued keys.)

A pseudocode implementation is given below:

procedureslowsort(A[],start_idx,end_idx)// Sort array range A[start ... end] in-place.ifstart_idx≥end_idxthenreturnmiddle_idx:=floor((start_idx+end_idx)/2)slowsort(A,start_idx,middle_idx)// (1.1)slowsort(A,middle_idx+1,end_idx)// (1.2)ifA[end_idx]<A[middle_idx]thenswap(A,end_idx,middle_idx)// (1.3)slowsort(A,start_idx,end_idx-1)// (2)

• Sort the first half, recursively. (1.1)
• Sort the second half, recursively. (1.2)
• Find the maximum of the whole array by comparing the results of 1.1 and 1.2, and place it at the end of the list. (1.3)
• Sort the entire list (except for the maximum now at the end), recursively. (2)

An unoptimized implementation in Haskell (purely functional) may look as follows:

slowsort::(Orda)=>[a]->[a]slowsortxs|lengthxs<=1=xs|otherwise=slowsortxs'++[maxllastrlast]-- (2)wherem=lengthxs`div`2l=slowsort$takemxs-- (1.1)r=slowsort$dropmxs-- (1.2)llast=lastlrlast=lastrxs'=initl++minllastrlast:initr

Complexity Analysis

The time complexity of Slowsort is given by the function ${\displaystyle T(n)=2T(n/2)+T(n-1)+1}$. It can be found by creating a recurrence relation of the initial recursive calls (1.1) and (1.2) respectively and summing the final recursive call (2) and modelling the other operations as a constant (+1) in this case. This gives a lower asymptotic bound for ${\displaystyle T(n)}$ in Landau notation is given as ${\displaystyle \Omega \left(n^{\log _{2}(n)/(2+\epsilon )}\right)}$ for any ${\displaystyle \epsilon >0}$. Therefore Slowsort is not in polynomial time.

References

1. Andrei Broder; Jorge Stolfi (1984). "Pessimal Algorithms and Simplexity Analysis" (PDF). ACM SIGACT News. 16 (3): 49–53. CiteSeerX   10.1.1.116.9158 . doi:10.1145/990534.990536. S2CID   6566140.