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; shorte...
ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-S cience/6-046JFall-2005/CourseHome/
-
Get Site Info
One or more results were not displayed because of
non-English
content.