Divide-and-conquer algorithm

Formal sciences
Theoretical computer science
Algorithms and data structures
Analysis of algorithms

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (25)

Page 2 of 3

Solving Recurrences and Recursion Trees

Covers techniques for solving recurrences and introduces the Master Theorem.

Sorting Algorithms: Selection and Insertion

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

Merge Sort: Divide and Conquer

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

Non-Stochastic Control Problem: Online Gradient Boosting

Explores online gradient boosting for non-stochastic control problems, emphasizing policy regret minimization and stability in control.

Dynamic Programming: Fibonacci Numbers

Covers dynamic programming with a focus on Fibonacci numbers and the rod cutting problem.

Search and Routing Protocols

Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.

Matrix Multiplication and Heaps: Efficient Algorithms

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

Solving Recurrences

Focuses on solving recurrences in divide-and-conquer algorithms using various techniques and examples.

Recursion and Karatsuba Multiplication

Explains recursion in algorithms and the Karatsuba multiplication method for large numbers.

Divide-and-Conquer: Merge Sort

Explores loop invariants, time analysis, and the Divide-and-Conquer approach with a focus on Merge Sort.