Introduction to Algorithms: Course Overview and Basics

Related lectures (18)

Page 1 of 2

Provides an overview of essential search and sort algorithms in computer science.

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Explores optimization problems and greedy algorithms for efficient decision-making.

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications in computer science.

Covers algorithms for searching, sorting, optimization, and the Halting Problem.

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Covers the basics of algorithms, the importance of studying them, data structures, and the impact of algorithms on various fields.