Pyramid sorting algorithm

Abstract

The invention discloses a pyramid sorting algorithm. According to the pyramid sorting algorithm, firstly, an integer m being integral power of 2 is found, and n is larger than m / 2 and smaller than or equal to m; then n data required to be sorted are placed into a b array; adjacent data in the b array are compared one by one, and relatively larger subscripts are placed in a (m / 2)-(m-1) unit of a c array; adjacent data in b[c[m-1]]-b[c[m / 2]] are compared one by one, relatively larger subscripts are placed in c[m / 2-1]-c[m / 4], and so on; finally, subscripts of maximum data of the whole b array can be placed in c[1]; then maximum values in the b array are found out continuously, and sorting is completed. Under the condition that to-be-sorted sequences are basically sorted, the sorting speed of the pyramid sorting algorithm is obviously superior to that of quick sorting; under the condition that to-be-sorted elements adopting a more complicated data structure are sorted, the sorting speed of the pyramid sorting algorithm is obviously superior to that of heap sorting.

Description

technical field [0001] The invention relates to a pyramid sorting algorithm. Background technique [0002] Currently, when sorting large amounts of data, the quicksort algorithm is usually chosen. Quick sort is a sorting algorithm with excellent performance, but if the quick sort reference value is not selected properly or the sequence to be sorted is basically ordered, the performance of quick sort will be greatly reduced. Heap sorting is faster than quick sorting when the sequence to be sorted is basically ordered, but heap sorting also has disadvantages: when the elements to be sorted are complex data structures, due to the large number of invalid moves in heap sorting, it also has a negative effect on heap sorting performance. greater impact. Contents of the invention [0003] The purpose of the present invention is to provide a pyramid sorting algorithm, which improves the sorting speed when the sequence to be sorted is basically ordered and the elements to be sorte...

AI Technical Summary

Problems solved by technology

Quick sort is a sorting algorithm with excellent performance, but if the quick sort reference value is not selected properly or the sequence to be sorted is basically ordered, the performance of quick sort will be greatly reduced

Heap sorting is faster than quick sorting when the sequence to be sorted is basically ordered, but heap sorting also has disadvantages: when the elements to be sorted are complex data structures, due to the large number of invalid moves in heap sorting, there is also a negative impact on heap sorting performance. greater impact