Define a recursive function merge :: Ord a => [a] -> [a] -> [a] that merges two sorted lists of values to give a single sorted list. For example: > merge [2,5,6] [1,3,4] [1,2,3,4,5,6]
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
1) Since you have not specified programming language, I have written program in python.
2) Below is python program to define a recursive merge function that merges two sorted lists of values to a single sorted list
- It defines a function merge that accepts two sorted list, merge and return single sorted list
- It compare the elements of two list
- add smaller value to the output list.
- let the recursion handle the merging of the remaining list
- It compare the elements of two list
- It has a test code which calls merge function and prints the returned single sorted list
3) Save program in python file and run
Step by step
Solved in 3 steps with 1 images