Heaps: Data Structure and Heapsort

Related lectures (27)

Page 1 of 3

Explores heaps, heapsort, and priority queues, including operations and analysis.

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Explores heapsort, priority queues, and their operations, highlighting time complexity and practicality.

Covers the Heapsort algorithm, which sorts arrays efficiently using max-heaps and introduces priority queues.

Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.

Covers the divide-and-conquer algorithm for matrix multiplication and introduces the (binary) heap data structure.

Covers optimal purely functional priority queues, Scala implementation, Stainless integration, operations properties, and binomial queues.

Focuses on solving 2019 Algorithms Midterm Exam problems and analyzing time complexities.

Explores the C++ vector, emphasizing the sizeof operator and vector analysis.