Full Article: [ Ссылка ]

• Heap sort is comparison based sorting algorithm.
• Heap sort is considered as improved selection sort, it divides the input into sorted and unsorted region.
• The improvement from selection sort is to use Heap Data Structure instead of using linear search algorithm to reduce of the time complexity.

свернуть