Download to read offline
Uploaded byimishtiaq
PPT, PDF79 views
Heapsort
Heap sort is a sorting algorithm that uses a heap data structure. It works in two phases: (1) building a max heap from the input data, and (2) extracting elements from the heap and inserting them into the output array. This results in the elements being sorted in O(n log n) time with O(1) auxiliary space. Heap sort is often preferred over other sorting algorithms for its efficiency and not requiring additional storage space.
