Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Maximum Subarray Problem
Graph Chatbot
Related lectures (26)
Previous
Page 2 of 3
Next
Introduction to Algorithms
Introduces the importance of studying algorithms, presents a clever algorithm for calculating an arithmetic series, and discusses efficiency and correctness in algorithms.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
Search Algorithms: Two Examples
Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.
Search Algorithms: Abductive Reasoning
Explores abductive reasoning, search algorithms, and heuristic search for problem-solving.
The Backpack Problem
Introduces the backpack problem, a discrete optimization problem with constraints and algorithms to solve it.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Reliable Broadcast: Overview and Algorithms
Explores reliable broadcast in distributed systems, presenting specifications, algorithms, and properties for different types of broadcast.
Linear Programming: Extreme Points
Explores extreme points in linear programming and the role of constraints in finding optimal solutions.
Dynamic Programming: Palindromic Subsequences
Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.
Entropy and Algorithms: Applications in Sorting and Weighing
Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.
