Merge Sort | Data Structures | Algorithms | Design and Analysis of Algorithms | DAA | Sorting |
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
