Dr. Aafaq Mohi Ud Din.

Video courses › Algorithms

Algorithm Arena · GATE CS

Algorithm design and analysis for GATE CS, with PYQs in every concept.

5 of 5 lectures published

Find the k-th Smallest WITHOUT Sorting: Selection Procedure8:55 · divide & conquer · recurrences

Watch ▸

Strassen's Matrix Multiplication6:19 · standard vs divide & conquer vs Strassen

Watch ▸

Heap Sort Explained Visually8:18 · build heap in O(n) · n log n always · not stable

Watch ▸

Graph Representation Explained Visually: Adjacency List vs Adjacency Matrix7:43

Watch ▸

Semantic Analysis, Visualised: Types, Scope & SDD8:33

Watch ▸