Lecture
This lecture introduces the basic ingredients of algorithms, main algorithm families like search and shortest path, and the concept of algorithm complexity. It covers examples such as sorting, finding the fastest route to EPFL, and the Euclidean algorithm. The lecture also discusses different types of search problems, the importance of clear problem specification, and the three types of control structures in algorithms. It concludes with the correctness of algorithms, their termination for all cases, and mathematical demonstrations.