Download to read offline
LO
Uploaded byLearning Courses Online
PPT, PDF675 views
Heap Sort || Heapify Method || Build Max Heap Algorithm
Heap sort is a comparison-based sorting algorithm that uses a heap data structure. It works in two phases: first it builds a max heap from the input data and then extracts elements from the heap one by one, each time putting the largest remaining element in its sorted position. This results in the elements being sorted in non-decreasing order with a time complexity of O(n log n). Heap sort is an efficient in-place sorting algorithm that uses constant extra space.
![Data Structures - Lecture 8 [Sorting Algorithms]](https://cdn.slidesharecdn.com/ss_thumbnails/lecture-8sortingalgorithms-150205105023-conversion-gate02-thumbnail.jpg?width=600ounds&width=560&fit=bounds)
