Question: In HASKELL Define a recursive function merge that merges two sorted lists so that the resulting list is also sorted. merge :: Ord a =>

In HASKELL

Define a recursive function merge that merges two sorted lists so that the resulting list is also sorted.

merge :: Ord a => [a] -> [a] -> [a]

For example: >merge [2,5,6] [1,3,4]

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

Note: your denition should not use other functions on sorted lists such as insert or isort, but should be dened using explicit recursion.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!