Free Algorithms Training Course免费算法训练课程
This course teaches the design of algorithms according to methodology and application.本课程讲授的设计算法根据的方法和应用。 Methodologies include: divide and conquer, dynamic programming, and greedy strategies.方法包括：分而治之，动态规划，和贪婪的战略。 Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms.应用包括：分拣，订购和搜索，图形算法，几何算法，数学（数论，代数与线性代数）的算法，和字符串匹配算法。 Analysis of algorithms is studied - worst case, average case, and amortized - with an emphasis on the close connection between the time complexity of an algorithm and the underlying data structures.分析算法的研究-最坏的情况下，平均情况下，和摊销-一个侧重于之间的密切联系的时间复杂度的算法和基本数据结构。 NP-Completeness theory is examined along with methods of coping with intractability, such as approximation and probabilistic algorithms.的NP完整性理论是研究随着方法应付棘手，如逼近和概率算法。
The available training and learning content includes Lecture Videos, Lecture Notes, Problem Sets, and Handouts.现有的培训和学习内容包括讲座，影片，讲义，问题集，和施舍。 The lecture videos are in Real Player format.讲座的影片是在真正的播放器格式。
Free Algorithms Training Course: 免费算法的训练课程：
aduni.org/courses/algorithms/ aduni.org /课程/算法/
Here is the Lectures and Courseware page: 这里是讲座和课件页：
aduni.org/courses/algorithms/index.php?view=cw aduni.org /课程/算法/的index.php ？看法=连续
Lecture Videos: 讲座的影片：
A high-speed mirror is available at The Internet Archive here: 一个高速的一面镜子，可在互联网档案馆在这里：
tinyurl.com/8q6bb tinyurl.com/8q6bb
www.archive.org/details-db.php?mediatype=movies&identifier=a... www.archive.org/details-db.php?mediatype=movies&identifier=a ...
Algorithms -- Overview: 算法-概述：
www.aduni.org:81/videos/02-01-01Lect.rm www.aduni.org:81/videos/02-01-01lect.rm
Sorting: 排序：
www.aduni.org:81/videos/02-02-01Lect.rm www.aduni.org:81/videos/02-02-01lect.rm
Sorting II: 排序二：
www.aduni.org:81/videos/02-04-01Lect.rm www.aduni.org:81/videos/02-04-01lect.rm
Searching & Data Structures: 搜索与数据结构：
www.aduni.org:81/videos/02-05-01Lect.rm www.aduni.org:81/videos/02-05-01lect.rm
Red-Black Trees: 红黑色的树木：
www.aduni.org:81/videos/02-06-01Lect.rm www.aduni.org:81/videos/02-06-01lect.rm
Graph Algorithms I - Topological Sorting, Prim's Algorithm: 图算法-拓扑排序，普里姆的算法：
www.aduni.org:81/videos/02-07-01Lect.rm www.aduni.org:81/videos/02-07-01lect.rm
Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure: 图算法的第二期-的D FS，黑脸琵鹭，克鲁斯卡尔的算法，联盟找到的数据结构：
www.aduni.org:81/videos/02-08-01Lect.rm www.aduni.org:81/videos/02-08-01lect.rm
Graph Algorithms III: Shortest Path: 图算法三：最短路径：
www.aduni.org:81/videos/02-09-01Lect.rm www.aduni.org:81/videos/02-09-01lect.rm
Graph Alg. 图算法。 IV: Intro to Geometric Algorithms: 第四部分：前言，以几何算法：
www.aduni.org:81/videos/02-12-01Lect.rm www.aduni.org:81/videos/02-12-01lect.rm
Geometric Algorithms: Graham & Jarvis: 几何算法：格雷厄姆＆贾维斯：
www.aduni.org:81/videos/02-13-01Lect.rm www.aduni.org:81/videos/02-13-01lect.rm
Dynamic Programming I: 动态规划：
www.aduni.org:81/videos/02-14-01Lect.rm www.aduni.org:81/videos/02-14-01lect.rm
Dynamic Programming II: 动态规划二：
www.aduni.org:81/videos/02-15-01Lect.rm www.aduni.org:81/videos/02-15-01lect.rm
Parsing: 解析：
www.aduni.org:81/videos/02-16-01Lect.rm www.aduni.org:81/videos/02-16-01lect.rm
Knapsack, Bandwidth Min. 背包，带宽分钟。 Intro: Greedy Algorithms: 简介：贪婪算法：
www.aduni.org:81/videos/02-20-01Lect.rm www.aduni.org:81/videos/02-20-01lect.rm
Greedy Algs. 贪婪algs 。 II & Intro to NP Completeness: 二＆介绍NP方案的完整性：
www.aduni.org:81/videos/02-21-01Lect.rm www.aduni.org:81/videos/02-21-01lect.rm
NP Completeness II & Reductions: NP的完整性，二＆削减：
www.aduni.org:81/videos/02-22-01Lect.rm www.aduni.org:81/videos/02-22-01lect.rm
NP Completeness III - More Reductions: NP的完整性，三-更多的削减：
www.aduni.org:81/videos/02-23-01Lect.rm www.aduni.org:81/videos/02-23-01lect.rm
NP Completeness IV: NP的完整性四：
www.aduni.org:81/videos/02-26-01Lect.rm www.aduni.org:81/videos/02-26-01lect.rm
Approximation Algorithms: 近似算法：
www.aduni.org:81/videos/02-27-01Lect.rm www.aduni.org:81/videos/02-27-01lect.rm
Alternate Models of Computation: 候补模型计算：
www.aduni.org:81/videos/02-28-01Lect.rm www.aduni.org:81/videos/02-28-01lect.rm Related Posts: 相关文章：
Free Algorithms Book免费的算法书 Python Data Structures and Algorithms Book Python的数据结构和算法的书 The Algorithm Design Manual该算法设计手册 Free Books on C++, AI, Neural Networks, Algorithms, Embedded, Web Design免费书籍C + +的，哎，神经网络，算法，嵌入式，网页设计 71 Free Computer Programming Books 71免费计算机编程书籍
The available training and learning content includes Lecture Videos, Lecture Notes, Problem Sets, and Handouts.现有的培训和学习内容包括讲座，影片，讲义，问题集，和施舍。 The lecture videos are in Real Player format.讲座的影片是在真正的播放器格式。
Free Algorithms Training Course: 免费算法的训练课程：
aduni.org/courses/algorithms/ aduni.org /课程/算法/
Here is the Lectures and Courseware page: 这里是讲座和课件页：
aduni.org/courses/algorithms/index.php?view=cw aduni.org /课程/算法/的index.php ？看法=连续
Lecture Videos: 讲座的影片：
A high-speed mirror is available at The Internet Archive here: 一个高速的一面镜子，可在互联网档案馆在这里：
tinyurl.com/8q6bb tinyurl.com/8q6bb
www.archive.org/details-db.php?mediatype=movies&identifier=a... www.archive.org/details-db.php?mediatype=movies&identifier=a ...
Algorithms -- Overview: 算法-概述：
www.aduni.org:81/videos/02-01-01Lect.rm www.aduni.org:81/videos/02-01-01lect.rm
Sorting: 排序：
www.aduni.org:81/videos/02-02-01Lect.rm www.aduni.org:81/videos/02-02-01lect.rm
Sorting II: 排序二：
www.aduni.org:81/videos/02-04-01Lect.rm www.aduni.org:81/videos/02-04-01lect.rm
Searching & Data Structures: 搜索与数据结构：
www.aduni.org:81/videos/02-05-01Lect.rm www.aduni.org:81/videos/02-05-01lect.rm
Red-Black Trees: 红黑色的树木：
www.aduni.org:81/videos/02-06-01Lect.rm www.aduni.org:81/videos/02-06-01lect.rm
Graph Algorithms I - Topological Sorting, Prim's Algorithm: 图算法-拓扑排序，普里姆的算法：
www.aduni.org:81/videos/02-07-01Lect.rm www.aduni.org:81/videos/02-07-01lect.rm
Graph Algorithms II - DFS, BFS, Kruskal's Algorithm, Union Find Data Structure: 图算法的第二期-的D FS，黑脸琵鹭，克鲁斯卡尔的算法，联盟找到的数据结构：
www.aduni.org:81/videos/02-08-01Lect.rm www.aduni.org:81/videos/02-08-01lect.rm
Graph Algorithms III: Shortest Path: 图算法三：最短路径：
www.aduni.org:81/videos/02-09-01Lect.rm www.aduni.org:81/videos/02-09-01lect.rm
Graph Alg. 图算法。 IV: Intro to Geometric Algorithms: 第四部分：前言，以几何算法：
www.aduni.org:81/videos/02-12-01Lect.rm www.aduni.org:81/videos/02-12-01lect.rm
Geometric Algorithms: Graham & Jarvis: 几何算法：格雷厄姆＆贾维斯：
www.aduni.org:81/videos/02-13-01Lect.rm www.aduni.org:81/videos/02-13-01lect.rm
Dynamic Programming I: 动态规划：
www.aduni.org:81/videos/02-14-01Lect.rm www.aduni.org:81/videos/02-14-01lect.rm
Dynamic Programming II: 动态规划二：
www.aduni.org:81/videos/02-15-01Lect.rm www.aduni.org:81/videos/02-15-01lect.rm
Parsing: 解析：
www.aduni.org:81/videos/02-16-01Lect.rm www.aduni.org:81/videos/02-16-01lect.rm
Knapsack, Bandwidth Min. 背包，带宽分钟。 Intro: Greedy Algorithms: 简介：贪婪算法：
www.aduni.org:81/videos/02-20-01Lect.rm www.aduni.org:81/videos/02-20-01lect.rm
Greedy Algs. 贪婪algs 。 II & Intro to NP Completeness: 二＆介绍NP方案的完整性：
www.aduni.org:81/videos/02-21-01Lect.rm www.aduni.org:81/videos/02-21-01lect.rm
NP Completeness II & Reductions: NP的完整性，二＆削减：
www.aduni.org:81/videos/02-22-01Lect.rm www.aduni.org:81/videos/02-22-01lect.rm
NP Completeness III - More Reductions: NP的完整性，三-更多的削减：
www.aduni.org:81/videos/02-23-01Lect.rm www.aduni.org:81/videos/02-23-01lect.rm
NP Completeness IV: NP的完整性四：
www.aduni.org:81/videos/02-26-01Lect.rm www.aduni.org:81/videos/02-26-01lect.rm
Approximation Algorithms: 近似算法：
www.aduni.org:81/videos/02-27-01Lect.rm www.aduni.org:81/videos/02-27-01lect.rm
Alternate Models of Computation: 候补模型计算：
www.aduni.org:81/videos/02-28-01Lect.rm www.aduni.org:81/videos/02-28-01lect.rm
Popularity: 39% [人气： 39 ％ [ ? ？ ] ]
