You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
Remix and Share
-
(Complete Item Description)
- Abstract:
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: 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.
- Subject:
- Science and Technology
- Grade Level:
- Post-secondary
- Collection:
-
MIT OpenCourseWare
Remix and Share
-
(Complete Item Description)
- Abstract:
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: 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.
- Subject:
- Science and Technology
- Grade Level:
- Post-secondary
- Collection:
-
MIT OpenCourseWare
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
