Properly implementing a merge-insertion sort in C++, and it's possible use

Question

So I\'m trying to implement a Merge-Insertion sort in C++, where the recursive Merge method will be used until the segment length is less than 7, at which point an insertion