@LuisMendo I've been trying it out in MATL, but it's not really working yet. I feel that there should be a clever way of doing this given that modular indexing is easy in MATL, but i'm yet to find it. But I'll see.
@Sanchises I wrote a program to check/generate the test cases and used 26 bytes. My feeling is that, inspite of modular indexing, it's not particularly easy (i.e. short) to do this
@EriktheOutgolfer That was an erratum in the documentation. Corrected, thanks!
k in that paragraph should have been y. Corrected too!
k is actually round down for numeric arrays, lowercase for char arrays
As for b with logical input spec (TTFT$), it applies the bubbling within the specified inputs. So it doesn't bubble up the specified inputs; it bubbles up the lowest of them, which is moved to where the highest of them was
