stooge sort

Summary

stooge sort is a sorting algorithm^[1]. It draws 191 Wikipedia views per month (sorting_algorithm category, ranking #8 of 29).^[2]

Key Facts

• stooge sort's image is recorded as Sorting stoogesort anim.gif^[3].
• stooge sort's instance of is recorded as sorting algorithm^[4].
• stooge sort's instance of is recorded as comparison sort^[5].
• stooge sort's Freebase ID is recorded as /m/02qf22^[6].
• stooge sort's uses is recorded as array data structure^[7].
• stooge sort's worst-case time complexity is recorded as O(n^{log{3}/log{1.5}})^[8].
• stooge sort's worst-case space complexity is recorded as O( n )^[9].
• stooge sort's Rosetta Code page ID is recorded as Sorting_algorithms/Stooge_sort^[10].
• stooge sort's Dictionary of Algorithms and Data Structures ID is recorded as stoogesort^[11].
• stooge sort's Microsoft Academic ID is recorded as 121662688^[12].

Body

Designation and Status

Recorded instance of include sorting algorithm^[4] and comparison sort^[5].

Why It Matters

stooge sort draws 191 Wikipedia views per month (sorting_algorithm category, ranking #8 of 29).^[2] It has Wikipedia articles in 12 language editions, a strong signal of global cultural recognition.^[13] It is known by 8 alternative names across languages and contexts.^[14]