Year: 2017
Type: article
Abstract: A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the method, the ordered keywords in the array are put into the heap one by one after building an empty heap. This method needs relatively less space and is fit for ordered sequence.
Authors: Haiming Li, Ping Chen, Yong Wang
Institution: Shanghai University of Electric Power
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W2767012303