Sorting algorithms/Bogosort: Difference between revisions
add BQN
Thundergnat (talk | contribs) m (syntax highlighting fixup automation) |
(add BQN) |
||
Line 828:
383150 shuffles required to sort 10 items.
</pre>
=={{header|BQN}}==
Requires the <code>_while_</code> idiom because the recursive version <code>{(ππ©βΛβ’rand.Dealββ )β(π©β’β§π©)π©}</code> quickly runs out of stack depth.
<syntaxhighlight lang="bqn">_while_β{π½βπΎβπ½_π£_πΎβπ½βπΎπ©}
Bogoβ{π©βΛβ’rand.Dealβ π©}_while_(β’ββ§)</syntaxhighlight>
=={{header|Brat}}==
|