Concept
Fibonacci heap
Related lectures (27)
Matrix Multiplication and Heap Data Structure
Covers the divide-and-conquer algorithm for matrix multiplication and introduces the (binary) heap data structure.
Memory Management & Crash Programs
Covers memory management for engineers, focusing on crash programs related to memory access errors.
Memory Management: Crash Reasons and Solutions
Delves into the reasons behind program crashes related to memory management.
Heaps and Priority Queues
Explores heaps, heapsort, and priority queues, including operations and analysis.
Register Machine
Covers the efficiency of register machines over stack machines, memory organization, and mapping instructions.
Green's Theorem in 2D: Applications
Explores the applications of Green's Theorem in 2D, emphasizing the importance of regular domains for successful integration.
Matrix Multiplication: Strassen's Algorithm
Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.
Heaps and Heapsort
Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.
Heaps: Data Structure and Heapsort
Explores heaps, heapsort, and their efficiency in implementing priority queues.
Optimization Theorem: Lagrange and Integrals
Explores Lagrange's optimization theorem, integration bounds transformation, and singularity removal.