Sorting algorithm Getting Started merge sort (Java implementation)

Merge sort is a typical application of divide-and-conquer method. Reference data structure and algorithm analysis-java language description

Merge sort actually two things to do:

(1) "decomposition"--divides the sequence binary each time.

(2) "Merge"--merges two sorted tables.

Merge: For two input arrays A and B, an output array of C, and 3 counters actr, Bctr, cctr, their initial placement at the beginning of the corresponding array. A[ACTR] and b[bctr] the smaller copy to the next position in C, the related counter advances one step forward. When one of the two input tables is exhausted, copies the remaining parts of the other table to C.

Worst run time O (NLOGN)

Sorting algorithm Getting Started merge sort (Java implementation)