Shulou(Shulou.com)06/01 Report--

This article mainly introduces "how to use the Java merge sorting method". In the daily operation, I believe that many people have doubts about how to use the Java merge sorting method. The editor consulted all kinds of materials and sorted out simple and easy-to-use operation methods. I hope it will be helpful to answer the doubts about "how to use the Java merge sorting method". Next, please follow the editor to study!

The merge sorting method is used to sort a group of data from small to large, the data are 695, 458, 362, 789, 12, 15, 163, 23, 2, 986 respectively.

1. Program analysis

The merging process is to compare the size of a [I] and a [j]. If a [I] ≤ a [j], copy the element a [I] from the first ordered table to r [k] and add 1 to I and k respectively. Otherwise, copy the element a [j] from the second ordered table to r [k] and add 1 to j and k respectively, and cycle until one of the ordered tables is finished, and then copy the remaining elements in the other ordered table to the unit in r from subscript k to subscript t. The algorithm of merging and sorting is usually implemented recursively. First, the interval to be sorted is dichotomized by the midpoint, then the left subinterval is sorted, and then the right subinterval is sorted. Finally, the left interval and the right interval are merged into an ordered interval by a merge operation.

Merging is the merging of two or more ordered record sequences into a single ordered sequence. There are many kinds of merging methods, including merging two ordered records at one time, which is called two-way merge sort, and there are also three-way merge sort and multi-way merge sort. This routine adopts two-way merge sorting, and the basic methods are as follows:

A. Treat n records as n ordered subtables of length 1.

B. merge the ordered subtables adjacent to each other.

C, execute b repeatedly until it is merged into an ordered table of length n.

2. Program realization

/ * * Topic: sort a set of data from small to large by merging and sorting The data are * 695, 458, 362,789, 12, 15, 163, 23, 2, 986 * File Name: MergeSort * Author: Jack Cui * Created: 4 April 2016 * / # include / * merge sort function declaration * / void MergeSort (int iSourceArr [] Int iTempArr [], int iStartIndex,int iEndIndex) Void Merge (int iSourceArr [], int iTempArr [], int iStartIndex,int iMidIndex,int iEndIndex); int main (void) {int iCommand iArrcrib [10], iArr_a [10]; printf ("Please enter 10 numbers:\ n"); for (I = 0 for I < 10 for +) scanf ("% d", & iArr_ a [I]); MergeSort (iArr_a,iArr_b,0,9); printf ("the order after quick sorting is:\ n") For (I = 0 + printf ("% 5d", iArr_ a [I]); printf ("\ n"); return 0 } / * * function name: MergeSort* parameter description: iSourceArr [] original array * iTempArr [] temporary array * iStartIndex start position index value * iEndIndex end position index value * description: two-way merge sort * * * / void MergeSort (int iSourceArr [] Int iTempArr [], int iStartIndex,int iEndIndex) {int iMidIndex If (iStartIndex < iEndIndex) {iMidIndex = (iStartIndex) / 2Tracer * Recursive call merges iSourceArr [iStartIndex] ~ iSourceArr [iMiddIndex] into ordered * / MergeSort (iSourceArr,iTempArr,iStartIndex,iMidIndex); / * Recursive call merges iSourceArr [iMiddIndex + 1] ~ iSourceArr [iEndIndex] into ordered * / MergeSort (iSourceArr,iTempArr,iMidIndex+1,iEndIndex); / * calls function to merge the first two parts into iSourceArr [iStartIndex] ~ iSourceArr [iEndIndex] * / Merge (iSourceArr,iTempArr,iStartIndex,iMidIndex,iEndIndex) }} / * * function name: Merge* parameter description: iSourceArr [] original array * iTempArr [] temporary array * iStartIndex start position index value * iMidIndex intermediate position index value * iEndIndex end position index value * Description: merge sort * * / void Merge (int iSourceArr [] Int iTempArr [], int iStartIndex,int iMidIndex,int iEndIndex) {int I = iStartIndex,j = iMidIndex + 1 Magi k = iStartIndex While (I

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.