Algorithm Design: Divide and Conquer

Related lectures (22)

Page 2 of 3

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.

Covers the analysis of algorithms, focusing on insertion sort and computational models.

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.