Heap (data structure)

Formal sciences
Theoretical computer science
Algorithms and data structures
Analysis of algorithms

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (28)

Page 2 of 3

Heapsort and Priority Queues

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

Algorithms Midterm Exam: Solving 2019 Problems

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

Memory Management: Address Space Abstraction

Explains address space abstraction, focusing on memory management, stack and heap structures, and their roles in dynamic memory allocation.

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.

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.

Covers the efficiency of register machines over stack machines, memory organization, and mapping instructions.

Understanding Vectors: sizeof()

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

Analysis of Randomized Quick Sort

Analyzes the running time and comparisons in randomized quick sort, proving its efficiency and optimality in comparison sorting.

Sorting Algorithms: Sorting Methods and Comparison

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.