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
Heaps and Heapsort
Description
This lecture covers the concept of divide-and-conquer, focusing on heaps and heapsort. It explains the (Binary) heap data structure, how to store a heap/tree using arrays, and maintaining the heap property through MAX-HEAPIFY. The instructor also discusses building a heap, time analysis, and the worst-case running time of BUILD-MAX-HEAP.
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.