Charles Leiserson, Erik DemaineErik DemaineCharles Leiserson2023-11-232023-11-232005https://repository.vlu.edu.vn/handle/123456789/10369Courses: Cấu trúc dữ liệu và giải thuật ; Included Materials: Syllabus, Video Lectures, Readings, Assignments, Exams ; Source: https://ocw.mit.edu/courses/6-046j-introduction-to-algorithms-sma-5503-fall-2005/ ; Language: Eng ; Publisher: MIT Open CoursewareThis 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 computingen-USResource Types::text::lecture