Two-way Merge Sorting

"Merge" means to combine two or more ordered tables into a new ordered table.

Take an array of n elements as an example: it can be seen as N ordered sub-tables. The length of each sub-table is 1 and then merged by two, obtain n/2 ordered sub-tables with a length of 2 or 1. Then merge them into two orders until they are merged into an ordered table with a length of N.

The following is a two-way Merge Sorting Algorithm implemented by recursion:

Void mergesort (int * a, int N) {mergepart (A, 0, n-1);} void mergepart (int * a, int low, int high) {If (low 





Two-way Merge Sorting