An efficient merge sort technique that reduces both times and comparisons

We proposed a new but simple and efficient merge sort technique. This method has several advantages on performance over previous merge sort technique. This technique divides the whole data as like divided and conquer method but until two elements in a group instead of one in each group like traditional merge sort by [D. E. Knuth (1973)]. Then solves the divided parts and conquers them. The resulting efficiency of this method is that the division of problem is much less then the previous method, so the recursive call is also less. As a result we have less comparison and less computational time.