Implement Merge Sort in Python

[sobhanbera]

Algorithm/Data Structure: Merge Sort
Programming Language: Python
Difficulty: ⭐️⭐️⭐️

Issue Details

Description:
Merge Sort is a popular and efficient comparison-based sorting algorithm that divides an unsorted list into two halves, recursively sorts each half, and then merges the sorted halves back together. Your task is to implement the Merge Sort algorithm in Python. Your implementation should correctly sort a given list of elements in ascending order.

Additional Information:
If you are new to Merge Sort or need guidance on implementing it in Python, feel free to ask questions or seek help in the comments. This is a great opportunity for contributors to gain experience in sorting algorithms and algorithmic optimizations in Python.

Note:
Before starting to work on this issue, please comment below to express your interest and let us know if you have any questions or need clarification on the task.

[lowkeyypal]

Hi! @sobhanbera I am interested in working on this.

I've resolved the issue #213

[sobhanbera]

Hey @silentwraith03, I've assigned this issue to you. Do mention this issue when opening a PR.
Good Luck!

[lowkeyypal]

Hi @sobhanbera I've resolved the issue in PR #213

[siya100]

hey @sobhanbera
can you please assign me this issue