Merge-insertion sort

Merge-insertion sort is a hybrid sorting algorithm that combines elements of both merge sort and insertion sort. The primary aim of this algorithm is to take advantage of the efficiency of merge sort for larger datasets while leveraging the simplicity and speed of insertion sort for smaller datasets. ### How It Works: 1. **Divide Phase**: Like merge sort, the array is divided into smaller subarrays.