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 ％ [ ? ？ ] ]
