Description:
This PR presents a Python implementation of the Merge Sort algorithm, a highly efficient divide-and-conquer sorting technique. Merge Sort divides the unsorted list into n sublists, each containing one element, and then repeatedly merges sublists to produce new sorted sublists until only one sublist remains.
Changes Made:
I added a Python function, merge_sort(arr), which sorts a given list in ascending order using the Merge Sort algorithm. We have implemented user input for an unsorted list of integers. Displayed the sorted array as output.
Purpose:
This PR aims to provide a robust and efficient implementation of Merge Sort in Python. Merge Sort is suitable for sorting large datasets and offers consistent performance.
Testing:
The code has been rigorously tested with various input lists, including lists of different sizes and configurations, to ensure accurate and efficient sorting.
Pull Request: Merge Sort Implementation
Description: This PR presents a Python implementation of the Merge Sort algorithm, a highly efficient divide-and-conquer sorting technique. Merge Sort divides the unsorted list into n sublists, each containing one element, and then repeatedly merges sublists to produce new sorted sublists until only one sublist remains.
Changes Made: I added a Python function, merge_sort(arr), which sorts a given list in ascending order using the Merge Sort algorithm. We have implemented user input for an unsorted list of integers. Displayed the sorted array as output.
Purpose: This PR aims to provide a robust and efficient implementation of Merge Sort in Python. Merge Sort is suitable for sorting large datasets and offers consistent performance.
Testing: The code has been rigorously tested with various input lists, including lists of different sizes and configurations, to ensure accurate and efficient sorting.
Please review and merge this PR.