GitHub

Pull requests: namanchikara/Heap-sort----python3

Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.
Scientific Research Publishing

Wu, S.Z. (2002) The Analysis of Improved Heap Sorting Algorithm and Its Complexity. Journal of Northwest Normal University (Natural Science Edition), 38, 24-26.

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.
GitHub

Improved Heap sorting technique

In this adjusted version, the code is slightly more concise while maintaining readability. The changes include simplifying the conditional statements and loop ranges.
IEEE

Comparative of Advanced Sorting Algorithms (Quick Sort, Heap Sort, Merge Sort, Intro Sort, Radix Sort) Based on Time and Memory Usage

Abstract: Every algorithm has its own best-case as well as its worst-case scenario, so it is difficult to determine the best sorting algorithm just by its Big-O. Not only that, the amount of memory ...
Scientific Research Publishing

Huo, H.W. (2002) Research of Fast Sorting Algorithm. Microelectronic and Computers, 19, 6-9.

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.