HaskellでMergeSortを実装してみた - Qiita

myMergeSort :: Ord a => [a] -> [a] myMergeSort xs = merge (map (:[]) xs) [] where merge [] [] = [] merge [] [l] = l merge [] ls = merge ls [] merge [l] ret = merge [] (listMerge l [] [] : ret) merge (l:ls:lss) ret = merge lss (listMerge l ls [] : ret) listMerge :: Ord a => [a] -> [a] -> [a] -> [a] listMerge [] [] ret = reverse ret listMerge [] (y:ys) ret = listMerge [] ys (y:ret) listMerge (x:xs)

[futtafutta]

HaskellでMargeSortを実装してみた - Haskellタグが付けられた新着投稿 - Qiita