Lectures related to Kruskal's algorithm

Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.

Explores optimization problems, greedy algorithms, and the Cashier's Algorithm for finding the least total number of coins.

Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.