Levenshtein Distance Sort FIXED by tails (whio)

print@x=<>=~/\D/sg,map//g,sort{$a-$b}map{@n=10..99;@n=($n[0]+//,map{($=)=sort$n[1]+1,$=+1,($&ne$_)+shift@n}@x)for//g;$=.$_}<>

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page