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

This article mainly explains "how to use the fast sorting method of C language". Interested friends may wish to have a look at it. The method introduced in this paper is simple, fast and practical. Let's let the editor take you to learn how to use the C language rapid sorting method.

1. Topic: the fast sorting method is used to sort a group of data from small to large, and the data are 99, 45, 12, 36, 69, 22, 62, 796, 4, 696 respectively.

Second, ranking demonstration (extracted from Baidu encyclopedia):

Quick sort (Quicksort) is an improvement on bubble sorting.

Suppose the user enters the following array:

Subscript 012345 data 627389

Create variables iSecret0 (pointing to the first data), jroom5 (pointing to the last data), and kroom6 (assigned to the value of the first data).

We want to move all numbers smaller than k to the left of k, so we can start looking for numbers less than 6, starting with j, looking from right to left, and constantly decreasing the value of the variable j, and we find that the data of the first subscript 3 is smaller than 6. so move data 3 to subscript 0, data 6 of subscript 0 to subscript 3, and complete the first comparison:

Subscript 012345 data 327689

ITunes 0 jacks 3 kgs 6

Then, start the second comparison, this time to look for something larger than k, and you have to look for it from the back. By adding the variable I, it is found that the data of subscript 2 is the first one larger than k, so the data of subscript 2 is exchanged with data 7 of subscript 2 and 6 of the data of subscript 3 pointed to by j, and the data status becomes the following table:

Subscript 012345 data 326789

ITunes 2 jacks 3 kgs 6

Then, decrement the variable j and repeat the loop comparison above.

In this case, we do a loop and find that I and j "meet": they both point to subscript 2. Therefore, the first comparison is over. The results are as follows: the number on the left side of k (= 6) is smaller than it, and the number on the right side of k is larger than it.

Subscript 012345 data 326789

If I and j don't meet, add I to find the big one, and if not, then decrease j to find the small one, and repeat it again and again. Note that judgment and search are conducted at the same time.

Then, the data on both sides of k are grouped and the above process is carried out separately until there is no more grouping.

Note: the first quick sort will not directly get the final result, but will only divide the numbers larger than k and those smaller than k into both sides of k. To get the final result, you need to perform this step again on the array on both sides of subscript 2, and then decompose the array until the array can no longer be decomposed (there is only one data) to get the correct result.

Schematic diagram:

Third, code implementation:

C language code:

/ * 11th day, Quick sort * / # include # include / * Quick_Sort function declaration * / void Quick_Sort (int* pDataArray,int iDataStart,int iDataEnd); void main (void) {int a [10], I; printf ("Please enter 10 numbers:\ n"); for (I = 0 for I < 10 +) scanf_s ("% d", & a [I]); Quick_Sort (aPower0Pol 9) Printf ("sorted order is:\ n"); for (I = 0 position I < 10 +) printf ("% 5d", a [I]); printf ("\ n"); system ("pause") } / * * function name: Quick_Sort * * Parameter description: pDataArray unordered array * * iDataStart unordered array element first * * iDataEnd unordered array element tail * * description: quick sort * * / void Quick_Sort (int* pDataArray Int iDataStart,int iDataEnd) {int iMagazine j Int iDataTemp; i = iDataStart; / / assign the first element of each group to ij = iDataEnd; / / assign the last element of each group to jiDataTemp = pDataArray [iDataStart] / / set the benchmark value while (I < j) {while ((I < j) & & (iDataTemp < pDataArray [j])) / / pick out the index value of the element that is smaller than the benchmark value / / move the position left to if (I < j) / / swap element position {pDataArray [I] = pDataArray [j]; / / swap position iTunes + / / move position to the right} while ((I < j) & & (pDataArray [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.