Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Heaps: Data Structure and Heapsort
This lecture covers the concept of heaps, including max-heap and min-heap, storing heaps in arrays, maintaining the heap property, pseudo-code and analysis of max-heapify, building a heap, correctness of heap operations, heapsort algorithm, and its implementation details. The instructor explains how heapsort runs in O(nlog n) time, its comparison with quicksort, and the efficiency of heaps in implementing priority queues.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace