Lyndon word: Difference between revisions
m
→{{header|EasyLang}}
m (→{{header|jq}}: assumption) |
|||
Line 33:
.
x$[] = strchars substr x$ 1 n
while len x$[] > 0 and x$[
len x$[] -1
.
if lx > 0
repeat
i += 1
until alpha$[i] = x$[
.
x$[
.
return strjoin x$[]
|