Stooge sort
id:
stooge-sort-312-5414948
title:
Stooge sort
text:
Stooge sort is a recursive sorting algorithm. It is notable for its exceptionally bad time complexity of O = O The running time of the algorithm is thus slower compared to reasonable sorting algorithms, and is slower than bubble sort, a canonical example of a fairly inefficient sort. It is however more efficient than Slowsort. The name comes from The Three Stooges. The algorithm is defined as follows: If the value at the start is larger than the value at the end, swap them.
If there are three or
brand slug:
wiki
category slug:
encyclopedia
description:
Inefficient recursive sorting algorithm
original url:
https://en.wikipedia.org/wiki/Stooge_sort
date created:
date modified:
2024-02-05T16:55:06Z
main entity:
{"identifier":"Q1754846","url":"https://www.wikidata.org/entity/Q1754846"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/f/f8/Sorting_stoogesort_anim.gif","width":277,"height":344}
fields total:
13
integrity:
15