Introduction to Algorithms
Data structures, sorting, hashing, graph search, shortest paths, and dynamic programming, with lecture videos, notes, and problem sets.
Solving a computational problem well starts with modeling it mathematically and choosing the right data structure and algorithm. The course works through elementary data structures such as dynamic arrays, heaps, balanced binary search trees and hash tables, and classical approaches to sorting, graph searching and dynamic programming, always relating each algorithm to how it is programmed and how fast it runs.
What You Will Achieve
- Analyze the performance of an algorithm with basic measures and techniques
- Choose among dynamic arrays, heaps, binary search trees, and hash tables for a problem
- Find shortest paths with breadth-first search, Bellman-Ford, and Dijkstra’s algorithm
- Design dynamic programming solutions by defining recursive subproblems
Program Overview
Data Structures and Sorting
Storing data so that common operations are fast.
- Data structures and dynamic arrays
- Sorting, hashing, and linear sorting
- Binary trees and AVL trees
- Binary heaps
Graph Algorithms
Searching graphs and finding shortest paths.
- Breadth-first and depth-first search
- Weighted shortest paths and Bellman-Ford
- Dijkstra’s and Johnson’s algorithms
Dynamic Programming and Complexity
Breaking problems into subproblems, and the limits of what is efficient.
- Recursive algorithms and subproblems
- All-pairs shortest paths and other examples
- Pseudopolynomial time and complexity
Course Completion
Job Outlook
Algorithms and data structures are core to software engineering, technical interviews, systems design and research, and to any role that writes code that has to scale.
Good for: Programmers who want a rigorous grounding in algorithms and data structures, with recorded lectures and full solutions to practice with.
Keep in mind: The course strongly cautions against starting before its prerequisites, and a short first problem set checks that background before the main material.
Bottom line: A recent, fully recorded algorithms course with lecture and recitation notes and solutions to every problem set, quiz, and the final.
Frequently Asked Questions
Is a textbook required?
No. The written material is the notes from lectures and recitations. Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein, third edition, is a useful reference but is not required.
Can I check my work on the problem sets?
Yes. Solutions are published for all nine problem sets, including the first one that checks your background, and for the three quizzes and the final exam.
Which shortest-path algorithms are taught?
Breadth-first search for unweighted graphs, Bellman-Ford, Dijkstra's algorithm, and Johnson's algorithm, followed by all-pairs shortest paths with dynamic programming.



There are no reviews yet.