Сортировка пузырьком

bsort xs = loop2 xs
    where
        loop ch acc (a : b : t) = if a <= b then loop ch (a : acc) (b : t)
                                            else loop True (b : acc) (a : t)
        loop ch acc [a] = loop ch (a : acc) []
        loop ch acc []  = (ch, reverse acc)
        loop2 xs = 
            case loop False [] xs of (True, xs) -> loop2 xs 
                                     (_, xs)    -> xs

bsort xs = case loop False [] xs of
    (True, xs)              -> bsort xs 
    (_, xs)                 -> xs    
  where
    loop ch acc xs = case xs of
        a:b:t   | a <= b    -> loop ch   (a:acc) (b:t)
                | otherwise -> loop True (b:acc) (a:t)
        a:t                 -> loop ch   (a:acc) []
        _                   -> (ch, reverse acc)

ite :: (Ord a) => [a] -> Int -> [a] -> (Int,[a])
ite [x] n r = (n,r++[x])
ite (x1:x2:xs) n r | (x2 >= x1) = ite (x2:xs) n (r ++ [x1]) 
                   | otherwise = ite (x1:xs) (n+1) (r ++ [x2])
                   
bubble :: (Ord a) => [a] -> [a]
bubble x = if (g == 0) then xx else bubble xx
           where (g,xx) = ite x 0 []
 
Main> bubble [1,2,3,1,2,3]
[1,1,2,2,3,3]
Main> bubble "abrakadabra"
"aaaaabbdkrr"