Add Merge Sort Linked List algorithm

[Hardvan]

The Merge Sort for Linked List algorithm sorts a linked list by recursively dividing it into two halves, sorting each half, and then merging the sorted halves back together. It uses the divide-and-conquer approach and the merge step to ensure that the resulting linked list is sorted. The key steps include finding the middle of the list to divide it and merging two sorted lists.

Algorithm Steps:

1. Base Case: If the list is empty or contains a single node, it is already sorted.
2. Dividing the List: Use the slow and fast pointer technique to find the middle of the linked list. Split the list into two halves.
3. Recursive Sorting: Recursively apply merge sort to both the left and right halves of the list.
4. Merge Step: Merge the two sorted halves into a single sorted linked list using a helper function that compares the nodes of both lists and links them in order.
5. Result: The sorted linked list is returned after all recursive calls are complete and all sublists have been merged.

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that pull requests will not be merged if they fail the automated tests.
• This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
• All new Python files are placed inside an existing directory.
• All filenames are in all lowercase characters with no spaces or dashes.
• All functions and variable names follow Python naming conventions.
• All function parameters and return values are annotated with Python type hints.
• All functions have doctests that pass the automated testing.
• All new algorithms include at least one URL that points to Wikipedia or another similar explanation.
• If this pull request resolves one or more open issues then the description above includes the issue number(s) with a closing keyword: "Fixes #ISSUE-NUMBER".

[algorithms-keeper]

Multiple Pull Request Detected

@Hardvan, we are extremely excited that you want to submit multiple algorithms in this repository but we have a limit on how many pull request a user can keep open at a time. This is to make sure all maintainers and users focus on a limited number of pull requests at a time to maintain the quality of the code.

This pull request is being closed as the user already has an open pull request. Please focus on your previous pull request before opening another one. Thank you for your cooperation.

User opened pull requests (including this one): #11672, #11668, #11667, #11589