Sorting a list of strings

[weedweaver]

how do i go about sorting a list of strings in haskell e.g. on input:

["Noradh","Marges","letsee","telegrams","Sharan's","sees"]

[weedweaver]

its ok, i got it... just a simple quicksort algorithm:

sortList :: [String] -> [String]
sortList [] = []
sortList (x:xs) = sortList [ y | y <- xs, y<=x] ++ [x] ++ sortList [ y | y <- xs, y > x]

[jemfinch]

That quicksort is inefficient, turning what should be an O(n log n) (normal case) algorithm into O(n**2).

Use merge sort instead. It's just as easy to write and guaranteed to be O(n log n).

Jeremy