[{"title":"( 25 个子文件 65.55MB ) MIT算法导论公开课的课程笔记(个人总结)","children":[{"title":"MIT算法导论公开课之课程笔记","children":[{"title":"9.二叉搜索树.docx <span style='color:#111;'> 483.83KB </span>","children":null,"spread":false},{"title":"~$.扩充的数据结构、动态有序统计和区间树.docx <span style='color:#111;'> 162B </span>","children":null,"spread":false},{"title":"6.顺序统计、中值.docx <span style='color:#111;'> 333.37KB </span>","children":null,"spread":false},{"title":"23.高级课题、缓存参数无关算法(二).docx <span style='color:#111;'> 4.44MB </span>","children":null,"spread":false},{"title":"1.课程简介及算法分析.docx <span style='color:#111;'> 383.04KB </span>","children":null,"spread":false},{"title":"5.线性时间排序.docx <span style='color:#111;'> 51.81KB </span>","children":null,"spread":false},{"title":"15.动态规划、最长公共子序列.docx <span style='color:#111;'> 5.31MB </span>","children":null,"spread":false},{"title":"20.高级课题、并行算法(一).docx <span style='color:#111;'> 2.29MB </span>","children":null,"spread":false},{"title":"16.贪婪算法、最小生成树.docx <span style='color:#111;'> 9.94MB </span>","children":null,"spread":false},{"title":"2.渐进符号、递归及解法.docx <span style='color:#111;'> 431.89KB </span>","children":null,"spread":false},{"title":"~$线性时间排序.docx <span style='color:#111;'> 162B </span>","children":null,"spread":false},{"title":"7.哈希表.docx <span style='color:#111;'> 385.59KB </span>","children":null,"spread":false},{"title":"3.分治法.docx <span style='color:#111;'> 1.16MB </span>","children":null,"spread":false},{"title":"4.快排及随机化算法.docx <span style='color:#111;'> 641.23KB </span>","children":null,"spread":false},{"title":"19.最短路径算法、点的最短路径.docx <span style='color:#111;'> 4.69MB </span>","children":null,"spread":false},{"title":"17.最短路径算法、Dijkstra算法、广度优先搜索.docx <span style='color:#111;'> 4.02MB </span>","children":null,"spread":false},{"title":"12.跳跃表.docx <span style='color:#111;'> 1.88MB </span>","children":null,"spread":false},{"title":"22.高级课题、缓存参数无关算法(一).docx <span style='color:#111;'> 7.54MB </span>","children":null,"spread":false},{"title":"21.高级课题、并行算法(二).docx <span style='color:#111;'> 1.45MB </span>","children":null,"spread":false},{"title":"8.全域哈希和完全哈希.docx <span style='color:#111;'> 308.53KB </span>","children":null,"spread":false},{"title":"10.平衡搜索树.docx <span style='color:#111;'> 1.62MB </span>","children":null,"spread":false},{"title":"13.平摊分析、表的扩增、势能方法.docx <span style='color:#111;'> 5.33MB </span>","children":null,"spread":false},{"title":"14.竞争性分析、自组织表.docx <span style='color:#111;'> 7.89MB </span>","children":null,"spread":false},{"title":"11.扩充的数据结构、动态有序统计和区间树.docx <span style='color:#111;'> 1023.83KB </span>","children":null,"spread":false},{"title":"18.最短路径算法、Bellman和差分约束系统.docx <span style='color:#111;'> 4.25MB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]