Haskell Language Sorting Algorithms Selection sort
Example
Selection sort selects the minimum element, repeatedly, until the list is empty.
import Data.List (minimum, delete)
ssort :: Ord t => [t] -> [t]
ssort [] = []
ssort xs = let { x = minimum xs }
in x : ssort (delete x xs)
