Algorithm-Merge Sorting Algorithm

Algorithm-Merge Sorting Algorithm

Merge Sorting is a highly efficient algorithm. The division and control method is a commonly used method to solve problems. Currently, popular cloud computing is actually an application of the division and control method.

The literal interpretation of the so-called divide and conquer method is to divide a complicated problem into two or more identical or similar subproblems, until the final sub-problem can be solved simply and directly, the solution of the original problem is the merge of the sub-problem solutions. This idea plays a very important role in practical work, especially when dealing with big data and complex operations.

The basis of merge Sorting is the merge operation merge, which combines two ordered arrays into an ordered array.

The algorithm for merging and sorting is as follows:
Scan the array for the first time, and split the adjacent two elements in the array into an ordered array.
The second scan combines adjacent ordered arrays into a larger ordered array.
Perform n scans and merge the arrays until the sorting is completed.

Vc/examples/nt0nsqy9425sb3tultwxrw9us + yotDywdDOsjwvcD4KPHA + CrrDwcvO0sPHsLTV1cnPw + signature + Signature = "brush: java;">

More and more recognition of the importance of recursive algorithms, skilled application of recursion can solve many practical problems.

The theory of recursion can be referred to http://www.cnsecer.com/4146.html