# Documentation

## Merge Sort for Linked List

<a><img src= "https://img.shields.io/badge/-Microsoft-blue" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Adobe-red" height="25"></a>&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Amazon-violet" height="25"></a>&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Paytm-orange" height="25"></a>&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Python-brightgreen"></a>

#### Problem Statement

Given Pointer/Reference to the head of the linked list, the task is to Sort the given linked list using Merge Sort.
Note: If the length of linked list is odd, then the extra node should go in the first list while splitting.

    Example 1:

    Input:
    N = 5
    value[]  = {3,5,2,4,1}
    Output: 1 2 3 4 5
    Explanation: After sorting the given
    linked list, the resultant matrix
    will be 1->2->3->4->5.




#### Solution

To be added soon ... .. ...

