23 Folgen

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

Introduction to Algorithms (2005) MIT

    • Technologie
    • 4.0, 24 Bewertungen

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

Kundenrezensionen

4.0 von 5
24 Bewertungen

24 Bewertungen

Top‑Podcasts in Technologie

Zuhörer haben auch Folgendes abonniert:

Mehr von MIT