Algorithms: Design and Analysis Part 2

Stanford University online course

Lectures

Two Motivating Applications
Introduction to Greedy Algorithms
A Scheduling Application
Prims Minimum Spanning Tree Algorithm
Kruskals Minimum Spanning Tree Algorithm
Clustering
Advanced Union Find
Huffman Codes
Introduction to Dynamic Programming
The Knapsack Problem
Sequence Alignment
Optimal Binary Search Trees
The Bellman-Ford Algorithm
All Pairs Shortest Paths
NP-Complete Problems
Faster Exact Algorithms for NP-Complete Problems
Approximations Algorithms for NP-Complete Problems
Local Search
The Wider World of Algorithms

Name		Name	Last commit message	Last commit date
Latest commit History 24 Commits
homework1		homework1
homework2		homework2
homework3		homework3
homework4		homework4
homework5		homework5
homework6		homework6
.gitignore		.gitignore
1 - Two Motivating Applications.pdf		1 - Two Motivating Applications.pdf
10 - The Knapsack Problem.pdf		10 - The Knapsack Problem.pdf
11 - Sequence Alignment.pdf		11 - Sequence Alignment.pdf
12 - Optimal Binary Search Trees.pdf		12 - Optimal Binary Search Trees.pdf
13 - The Bellman-Ford Algorithm.pdf		13 - The Bellman-Ford Algorithm.pdf
14 - All Pairs Shortest Paths.pdf		14 - All Pairs Shortest Paths.pdf
15 - NP-Complete Problems.pdf		15 - NP-Complete Problems.pdf
16 - Faster Exact Algorithms for NP-Complete Problems.pdf		16 - Faster Exact Algorithms for NP-Complete Problems.pdf
17 - Approximation Algorithms for NP-Complete Problems.pdf		17 - Approximation Algorithms for NP-Complete Problems.pdf
18 - Local Search.pdf		18 - Local Search.pdf
19 - The Wider World of Algorithms.pdf		19 - The Wider World of Algorithms.pdf
2 - Introduction to Greedy Algorithms.pdf		2 - Introduction to Greedy Algorithms.pdf
3 - A Scheduling Application.pdf		3 - A Scheduling Application.pdf
4 - Prims Minimum Spanning Tree Algorithm.pdf		4 - Prims Minimum Spanning Tree Algorithm.pdf
5 - Kruskals Minimum Spanning Tree Algorithm.pdf		5 - Kruskals Minimum Spanning Tree Algorithm.pdf
6 - Clustering.pdf		6 - Clustering.pdf
7 - Advanced Union Find.pdf		7 - Advanced Union Find.pdf
8 - Huffman Codes.pdf		8 - Huffman Codes.pdf
9 - Introduction to Dynamic Programming.pdf		9 - Introduction to Dynamic Programming.pdf
README.md		README.md

c-huynh/algorithms2

Folders and files

Latest commit

History

Repository files navigation

Algorithms: Design and Analysis Part 2

Lectures

About

Resources

Stars

Watchers

Forks

Languages