Haskell Quicksort

quicksort.hs

split :: Ord a => a -> [a] -> ([a],[a])
split x ys = accum x ys ([],[])
    where
    accum :: Ord a => a -> [a] -> ([a],[a]) -> ([a],[a])
    accum _ [] result = result
    accum x (y:ys) (ls,rs)
        | y > x = accum x ys (ls,y:rs)
        | otherwise = accum x ys (y:ls,rs)

sort :: Ord a => [a] -> [a]
sort [] = []
sort (x:xs) =  sort l ++ [x] ++ sort r
    where (l,r) = split x xs

main = print (sort [3,6,12,4,1,2,8,10,9,7,5,11])

I had fun writing this little quicksort implementation in Haskell this morning. What a geek!