))
Introduction to Algorithms
Marcați toate (ne)redate ...
Serii arhivate ("Sursă inactivă" status)
When?
This feed was archived on August 26, 2016 12:39 (
Why? Sursă inactivă status. Servele noastre nu au putut să preia o sursă valida de podcast pentru o perioadă îndelungată.
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
Content provided by Introduction to Algorithms. All podcast content including episodes, graphics, and podcast descriptions are uploaded and provided directly by Introduction to Algorithms or their podcast platform partner. If you believe someone is using your copyrighted work without your permission, you can follow the process outlined here https://ro.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 episoade
Distribuie
