Haskell Language Sorting Algorithms Insertion Sort
Example
insert :: Ord a => a -> [a] -> [a]
insert x [] = [x]
insert x (y:ys) | x < y = x:y:ys
| otherwise = y:(insert x ys)
isort :: Ord a => [a] -> [a]
isort [] = []
isort (x:xs) = insert x (isort xs)
Example use:
> isort [5,4,3,2,1]
Result:
[1,2,3,4,5]
