Homework 7 Recursive Haskell! Solution

Define recursive function merge :: Ord a = [a] - [a] - [a] that merges two sorted lists to give a single sorted list.



merge [2,5,6] [1,3,4]



[1,2,3,4,5,6]




Test out your function with Haskell.



You should assume that the input is sorted.



You should not used any extra functions, like insert.



Hand in your Haskell code, and your test cases. You need test cases. (This can be one piece of paper, if you wish).



Remember to add the cover sheet




http://ku-fpg.github.io/workbook/EECS_368/






































































































1