Lectures related to Algorithm Design: Divide and Conquer

Presents methods for problem-solving, emphasizing 'Divide and Conquer', recursion, and dynamic programming.

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

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

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

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

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

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Explores the recursive version of insertion sort algorithm, emphasizing recursion and dynamic programming concepts.

Explores recursive sorting algorithms, recursion, dynamic programming, and the efficiency of recursive solutions.

Explains recursive sorting using Merge Sort and its linearithmic complexity.

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

Explores worst-case complexity, mathematical induction, and algorithms like binary search and insertion sort.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Explores dichotomy search algorithms, analyzing complexity and implementation details for efficient searching in sorted lists.

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

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.

Covers the concept of Merge Sort, a recursive sorting algorithm that divides a list into sublists until each sublist has one element.

Explores the Merge Sort algorithm, applying the Divide and Conquer approach to sorting arrays efficiently.

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