The analysis of coordinate-recorded merge-sort based on the divide-and-conquer method

Many available algorithms are structurally recursive and can invoke the typical algorithm itself once or even more times to solve tightly related sub-problems. All of these algorithms follow the major principle called Divided-and-Conquer method, which first divides initial problem into several items same in goals but have a smaller scale. The Merge Sort uses this ideology to compass complexity and accelerate processing time. The coordinate-recorded merge sort algorithm continues the main idea, lets the processing problems get larger gradually, but directly works out solutions of the smallest subproblems at the very start, in other words, the dividing process becomes useless.