Stackless Stoogesort - Ported from ArrayV, and it's probably gonna take forever to visualize. Uses ternary counting to keep track of recursion, and it's slowed down a ton to make it visible, which is the main reason why it takes so long. Best/average/worst case: O(3^log_1.5(n)) Takes O(1) memory. Stable: Yes? (not sure with this port) Online: No In-Place: Yes Deterministic: Yes
Credit to fungamer2.
