Slowsort
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 1986 by Andrei Broder and Jorge Stolfi in their paper Pessimal Algorithms and Simplexity Analysis (a parody of optimal algorithms and complexity analysis).
Link from a Wikipage to another Wikipage
primaryTopic
Slowsort
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 1986 by Andrei Broder and Jorge Stolfi in their paper Pessimal Algorithms and Simplexity Analysis (a parody of optimal algorithms and complexity analysis).
has abstract
Slowsort (von engl. slow: lang ...... mplexity Analysis vorgestellt.
@de
Slowsort is a sorting algorith ...... thms and complexity analysis).
@en
Медленная сортировка (англ. Sl ...... алгоритмы и анализ сложности).
@ru
慢速排序是一種排序演算法。其基於合併排序的分而治之及遞迴的思 ...... is（論文名稱是漸進最優算法及計算複雜性理論的戲仿）中提出。
@zh
Wikipage page ID
37,869,566
page length (characters) of wiki page
Wikipage revision ID
1,021,877,244
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Slowsort (von engl. slow: lang ...... mplexity Analysis vorgestellt.
@de
Slowsort is a sorting algorith ...... thms and complexity analysis).
@en
Медленная сортировка (англ. Sl ...... алгоритмы и анализ сложности).
@ru
慢速排序是一種排序演算法。其基於合併排序的分而治之及遞迴的思 ...... is（論文名稱是漸進最優算法及計算複雜性理論的戲仿）中提出。
@zh
label
Slowsort
@de
Slowsort
@en
Медленная сортировка
@ru
慢速排序
@zh