Journal of Computer and Communications

Volume 5, Issue 12 (October 2017)

ISSN Print: 2327-5219   ISSN Online: 2327-5227

Google-based Impact Factor: 1.34  Citations  

Heap Sorting Based on Array Sorting

HTML  XML Download Download as PDF (Size: 368KB)  PP. 57-62  
DOI: 10.4236/jcc.2017.512006    1,160 Downloads   4,157 Views  Citations

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.

Share and Cite:

Li, H. , Chen, P. and Wang, Y. (2017) Heap Sorting Based on Array Sorting. Journal of Computer and Communications, 5, 57-62. doi: 10.4236/jcc.2017.512006.

Copyright © 2021 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.