Merge Sorting of data structures and algorithms

Merge Sorting: the sub-array sequence of each merge is ordered.

Time Complexity: O (nlog2n), the space cost is O (n)

The Code is as follows:

Int a [10] = {,}, B [10] = {0}; void merge (const int left, const int mid, const int right) {int s1 = left; int s2 = mid; int s3 = right, k, t = left; for (k = left; k <= mid; k ++) B [k] = a [k]; for (k = right; k> mid; k --) // Reverse Order B [right + mid + 1-k] = a [k]; while (t <= right) {if (B [s1] <= B [s3]) a [t ++] = B [s1 ++]; else a [t ++] = B [s3 --] ;}} void mergesort (int left, int right) {if (left> = right) return; int mid = (left + right)/2; mergesort (left, mid); mergesort (mid + 1, right ); merge (left, mid, right);} void show () {for (int I = 0; I <10; I ++) {cout <a [I] <";}cout <endl ;}int main () {show (); mergesort (); show (); return 0 ;}