Hyper Stoogesort

A variant of Stoogesort which recursively sorts the list's initial n-1 elements, then the final n-1 elements, and then the initial n-1 elements again.
Sorting algorithm made by fungamer2.
Algorithm showcased on ‪‪@PCBoyStudios' fork of ArrayV by ‪‪@Gaming32i.

Best-case performance: O(3ⁿ)
Average performance: O(3ⁿ)
Worst-case performance: O(3ⁿ)

Worst-case space complexity: O(n)

Видео Hyper Stoogesort канала gooflang