| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Tensort.OtherSorts.Mergesort
Description
This module provides an implementation of the mergesort algorithm.
Documentation
mergesort :: Ord a => [a] -> [a] Source #
Takes a list and returns a sorted list using a Mergesort algorithm.
Examples
>>>mergesort ([16, 23, 4, 8, 15, 42] :: [Int])[4,8,15,16,23,42]
>>>mergesort ([(1, 16), (5, 23), (2, 4) ,(3, 8), (0, 15) , (4, 42)] :: [(Int, Int)])[(0,15),(1,16),(2,4),(3,8),(4,42),(5,23)]