The first 90% of the code accounts for the first 90% of the development time. The remaining 10% of the code accounts for the other 90% of the development time. Tom Cargill
Merge sort is a comparison-based sorting algorithm. It uses divide and conquer logic to sort the items. Linked list is a data structure. Each record of a linked list is called as the node. The field of each node that contains the address of the next node.
Write a program to implement Merge sort using linked list.
Insert items in LinkedList:9 Insert items in LinkedList:43 Insert items in LinkedList:34 Insert items in LinkedList:11 Insert items in LinkedList:78 Insert items in LinkedList:55 Sort items in LinkedList:9->11->34->43->55->78->NULL