合并排序（Merge sort）.docVIP

合并排序（Merge sort） Merge sort This time I learned the merge sort. The main idea of merge sorting is to combine two already sorted sequences into a well ordered one Sequence. For example: 135792468, the two sequences are arranged separately, and then we merge to become 123456789 Ordered sequence. It seems that this is not related to sorting because the sorting gives a confused sequence, and the merge is the merge, and the two has been sorted Good sequence. Wait a minute, we can take into N sub sequence decomposition sort data, when the subsequence decomposition contains the number of data for the 1 time Well, then, is this sequence in order soon? And then merge. This is the famous divide and conquer.. (ha ha ha. I didnt expect that Good ideas can be learned here.). For example, 321 is divided into 3, 2, 1, three sequences, and 1, this sequence is ordered. (only one data is available But its orderly. When I was silly. Ha ha!). Similarly, 2 and 3 are orderly. Then we merged them one by one. 3, 2 combined to 23, Then merge between 23 and 1 for 123. Ha ha, sort successfully. The main idea of merge sort is this. But again, how do we merge the two sequences? I believe I should understand the way the array is stored, so say the array directly Thing.. We first target the index to the beginning of each ordered subsequence, and then locate the index of the array after the merge. Then subscript corresponds The position is their minimum current. Then compare them and place the smaller one in the index position of the array after the merge. such The first element of the merged array is their minimum. Next, control the index of the merged array and then move the decimal After the index corresponding to the sequence of words, shift one. Such. Next time he gets his second smallest (the first one has been merged) The current minimum value is the comparison of the current minimum value of another sequence, with the smaller one placed in the corresponding position of the merged array. su