Fibonacci Butt Sort

Let us discuss the various implementations of theFIBONACCI BUTT SORT.

>>139
That looks remarkably like the one I posted in the other thread — whereëver it went — in the control flow and use of cycle, anyway.

________
tag t str = "[" ++ t ++ "]" ++ str ++ "[/" ++ t ++ "]"
[b,i,o,u] = tag `map` words "b i o u"

dabs = b . i . unwords . zipWith id (cycle [o,u]) . words
fbs = b . i . concat . flip evalState (cycle [o,u]) . mapM f where
    f ' ' = return " "
    f c = (liftM . concatMap) ($ [c]) (State $ splitAt 1)