sort :: [ Int ] -> [ Int ] sort [] = [] sort (x : xs) = let ( low, high ) = partition ( < x ) xs in sort low ++ [ x ] ++ sort high
(und das einfache Quicksort bleibt übrig)!