Heaps: Representation and Implementation of Priority Queues
Learn how Min Heaps and Max Heaps work, how Binary Heaps are represented using arrays, and how insertion and deletion maintain the…
Articles
Notes, explanations and worked examples. Written to be read slowly and kept.
72 articles
Learn how Min Heaps and Max Heaps work, how Binary Heaps are represented using arrays, and how insertion and deletion maintain the…
Explore Circular Queues, Deques, and Priority Queues. Understand how they work, their operations, differences, and practical C implementations with simple examples.
Learn how vectors can be combined to construct new vectors, understand span geometrically, and explore how bases provide fundamental representations of vector…
Learn what vector spaces, linear combinations, and span mean in linear algebra, with clear examples, geometric explanations, and applications in AI.
Learn how to solve systems of linear equations using matrix inverses, with step-by-step examples, determinant calculations, and practical Python applications.
Understand the Queue data structure and its FIFO principle. Learn Enqueue, Dequeue, Front, and Rear operations with simple examples, C implementation, and…
Explore three important applications of stacks: balanced parenthesis checking, Infix to Postfix conversion, and Postfix expression evaluation, with step-by-step examples and C…
Learn how the Stack data structure works using the LIFO principle, with simple examples, basic operations, C implementation, and real-world applications.
Compare Linear Search, Binary Search, and five popular sorting algorithms. Understand their working methods, time complexities, and when to use each one.
Understand how Merge Sort and Quick Sort work with step-by-step examples, C implementations, and a comparison of their time and space complexity.