MergeSort Algorithm - Merge sort is a sorting algorithm that follows the divide-and-conquer approach. It works by recursively dividing the input array into smaller subarrays and sorting those subarrays then merging them back together to obtain the sorted array.
Time complexity - O(nlogn)
I’ve resolved issue #401 in my pull request, and this is my first contribution to open source. I would greatly appreciate your review and consideration for merging it. Thank you!
Resolved Issue #401
MergeSort Algorithm - Merge sort is a sorting algorithm that follows the divide-and-conquer approach. It works by recursively dividing the input array into smaller subarrays and sorting those subarrays then merging them back together to obtain the sorted array. Time complexity - O(nlogn)