))
Introduction to Algorithms
Markera alla som (o)spelade ...
Arkiverad serie ("Inaktivt flöde" status)
When?
This feed was archived on August 26, 2016 12:39 (
Why? Inaktivt flöde status. Våra servar kunde inte hämta ett giltigt podcast-flöde under en längre period.
What now? You might be able to find a more up-to-date version using the search function. This series will no longer be checked for updates. If you believe this to be in error, please check if the publisher's feed link below is valid and contact support to request the feed be restored or if you have any other concerns about this.
Manage series 182985
Innehåll tillhandahållet av Introduction to Algorithms. Allt poddinnehåll inklusive avsnitt, grafik och podcastbeskrivningar laddas upp och tillhandahålls direkt av Introduction to Algorithms eller deras podcastplattformspartner. Om du tror att någon använder ditt upphovsrättsskyddade verk utan din tillåtelse kan du följa processen som beskrivs här https://sv.player.fm/legal.
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.
The textbook for this course is: Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. 2nd ed. Cambridge, MA: MIT Press. ISBN: 0262032937.
This content is provided under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 license.
56 episoder
Dela
