返回信息流【此篇文章是由自动发信系统所张贴】
下载链接:http://bt.byr.edu.cn/download.php?id=30350
种子详情:http://bt.byr.edu.cn/show_detail.php?id=30350
种子发布者:CardMaster
资料类别:计算机
中文名:MIT算法导论(去弹出窗口)
英文名::MIT Open Course Introduction to Algorithms( no ad )
资料文件格式:视频
版本:
发行时间:2001
描述:jokerlee的种子下来发现有弹出窗口,虽然不是什么大问题,但是还是挺讨厌.将弹出窗口去掉了,重新作了种.
麻省理工开放课程:算法导论
视频 + 讲义 + 作业 +试题
课程主页:http://www.core.org.cn/OcwWeb/Electrical-Engineering-and-Computer-Science/6-046JFall-2005/CourseHome/index.htm
L1
Administrivia
Introduction
Analysis of Algorithms, Insertion Sort, Mergesort
L2
Asymptotic Notation
Recurrences
Substitution, Master Method
L3
Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication
L4
Quicksort, Randomized Algorithms
L5
Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort
L6
Order Statistics, Median
Bucketsort
L7
Hashing, Hash Functions
L8
Universal Hashing, Perfect Hashing
L9
Relation of BSTs to Quicksort
Analysis of Random BST
L10
Red-black Trees, Rotations, Insertions, Deletions
L11
Augmenting Data Structures, Dynamic Order Statistics, Interval Trees
L12
Skip Lists
L13
Amortized Algorithms, Table Doubling, Potential Method
L14
Competitive Analysis: Self-organizing Lists
L15
Dynamic Programming, Longest Common Subsequence
L16
Greedy Algorithms, Minimum Spanning Trees
L17
Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search
L18
Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints
L19
Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson
L20
Disjoint Sets
L21
Ethics, Problem Solving (Mandatory Attendance)
L22
Maximal Flow
L23
EdmondsKarp
L24
Suggestion for Future Study
这是一条镜像帖。来源:北邮人论坛 / b-tdocument / #1782同步于 2026/6/5
该镜像源已超过 30 天没有更新,可能在源站已被删除。
BTdocument机器人发帖
[计算机][MIT算法导论(去弹出窗口)][:MIT Open Course Introduc
deliver
2026/6/5镜像同步0 回复
订阅后,新回复会通过你的通知中心匿名送达。
0 条回复
暂无回复 · 你可以订阅本帖等待新回复。