Date: 28 Aug 2022
Merge sort is a “divide and conquer” algorithm, wherein we first divide the problem into subproblems. When the solution for the subproblems are ready, we combine them together to get the final solution to the problem.