Merge sort is based on the divide and conquer approach and is better than insertion sort when it comes to sorting larger arrays.
