Implemented the Merge Sort algorithm to efficiently sort an array by dividing the input array into two halves, sorting them recursively, and then merging the sorted halves. This algorithm follows the divide-and-conquer approach, ensuring a time complexity of O(n log n).This addition enhances the repository by providing a widely-used and fundamental sorting technique.
Implemented the Merge Sort algorithm to efficiently sort an array by dividing the input array into two halves, sorting them recursively, and then merging the sorted halves. This algorithm follows the divide-and-conquer approach, ensuring a time complexity of O(n log n).This addition enhances the repository by providing a widely-used and fundamental sorting technique.