Fast Algorithm sorting

Fast Algorithm sorting
Here is A brief introduction of the pseudo code implementation of quick sorting and: QuickSort (A, p, r) if p <r q = Partition (A, p, r) QuickSort (A, p, the key part of the QucikSort (A, q + 1, r) algorithm is the implementation of the Partition function. It realizes the sorting of the original address of array A (p, r: copy the code Partition (A, p, r) x = A [r] I = p-for j = p to R-1 if a [j] <= x I = I + 1 exchange a [I] with a [j] exchange [I + 1] with A [r] return I + 1 the deep mathematical formulas used to copy the code are omitted here, in the worst case, the quick sorting is O (n2), but using a random number can effectively avoid this situation. In addition, it can be proved that even if each sorting has a probability of 10% and is not in the worst case, it can be calculated that its final algorithm complexity is O (nlogn ), therefore, quick sorting is a very efficient algorithm. The average and Merge Sorting speed is about three times faster.