0

(

ratings

)

2

students

Created by:

Profile Photo

Last updated:

December 1, 2022

Duration:

Unlimited Duration

FREE

This course includes:

Unlimited Duration

Badge on Completion

Certificate of completion

Unlimited Duration

Description

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice.

Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow, computational geometry, number-theoretic algorithms, polynomial and matrix calculations, caching, and parallel computing

Course Curriculum

  • Introduction, median finding Unlimited
  • Median finding, interval scheduling Unlimited
  • Minimum spanning trees I Unlimited
  • Minimum spanning trees II Unlimited
  • Fast Fourier transform Unlimited
  • All-pairs shortest paths I Unlimited
  • All-pairs shortest paths II Unlimited
  • Randomized algorithms I Unlimited
  • Randomized algorithms II Unlimited
  • Hashing and amortization Unlimited
  • Amortized analysis Unlimited
  • Competitive analysis Unlimited
  • Network flow Unlimited
  • Interlude: problem solving Unlimited
  • van Emde Boas data structure Unlimited
  • Disjoint-set data structures Unlimited
  • Complexity and NP-completeness Unlimited
  • Polynomial-time approximations Unlimited
  • Compression and Huffman coding Unlimited
  • Sublinear-time algorithms Unlimited
  • Clustering Unlimited
  • Derandomization Unlimited
  • Computational geometry Unlimited

About the instructor

5 5

Instructor Rating

1

Reviews

1520

Courses

1915

Students

Profile Photo
Massachusetts Institute of Technology