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.
Lecture
Heapsort and Priority Queues
Description
This lecture covers the concept of heapsort, explaining how to build a heap from an unordered array, the worst-case running time of BUILD-MAX-HEAP, and the analysis of heapsort. It also delves into priority queues, discussing operations like INSERT and extracting the maximum element. The lecture concludes with a summary of heapsort's time complexity and practicality compared to quicksort, hinting at upcoming topics on using heaps for priority queues and other data structures.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.