Design and Analysis of Algorithms
| 文件类型 | 收录时间 | 最后活跃 | 资源热度 | 文件大小 | 文件数量 |
|---|---|---|---|---|---|
| 视频 | 2017-5-28 12:23 | 2024-7-2 01:39 | 104 | 824.48 MB | 52 |
迅雷链接
二维码链接
种子下载(838888不存储任何种子文件)
相关链接
文件列表
- Design and Analysis of Algorithms/Week1/I/1 - 2 - About the Course (17 min).mp4308.84KB
- Design and Analysis of Algorithms/Week1/II/2 - 1 - Big-Oh Notation (4 min).mp44.13MB
- Design and Analysis of Algorithms/Week5/XII/12 - 1 - Data Structures.mp44.66MB
- Design and Analysis of Algorithms/Week4/X/10 - 5 - Depth-First Search (DFS)- The Basics (7 min).mp47.16MB
- Design and Analysis of Algorithms/Week1/II/2 - 2 - Basic Examples (7 min).mp47.3MB
- Design and Analysis of Algorithms/Week3/IX/9 - 5 - Counting Minimum Cuts [Advanced - Optional] (7 min).mp47.42MB
- Design and Analysis of Algorithms/Week1/II/2 - 3 - Big Omega and Theta (7 min).mp47.49MB
- Design and Analysis of Algorithms/Week1/II/2 - 4 - Additional Examples [Review - Optional] (8 min).mp47.72MB
- Design and Analysis of Algorithms/Week4/X/10 - 3 - BFS and Shortest Paths (8 min).mp47.9MB
- Design and Analysis of Algorithms/Week2/4 - 1 - Motivation (8 min).mp48.26MB
- Design and Analysis of Algorithms/Week3/IX/9 - 3 - Random Contraction Algorithm (9 min).mp48.28MB
- Design and Analysis of Algorithms/Week2/6 - 3 - Analysis III_ Final Calculations [Advanced - Optional] (9min).mp48.92MB
- Design and Analysis of Algorithms/Week2/4 - 2 - Formal Statement (10 min).mp410.43MB
- Design and Analysis of Algorithms/Week1/I/1 - 3 - Merge Sort_ Motivation and Example (9 min).mp410.69MB
- Design and Analysis of Algorithms/Week1/I/1 - 5 - Merge Sort_ Analysis (9 min).mp411.32MB
- Design and Analysis of Algorithms/Week2/4 - 4 - Proof I (10 min).mp411.46MB
- Design and Analysis of Algorithms/Week2/5 - 3 - Correctness of Quicksort [Review - Optional] (11 min).mp411.83MB
- Design and Analysis of Algorithms/Week2/6 - 2 - Analysis II_ The Key Insight [Advanced - Optional] (12min).mp411.98MB
- Design and Analysis of Algorithms/Week2/5 - 1 - Quicksort_ Overview (12 min).mp412.2MB
- Design and Analysis of Algorithms/Week1/III/3 - 1 - O(n log n) Algorithm for Counting Inversions I (13 min).mp412.86MB
- Design and Analysis of Algorithms/Week5/XI/11 - 2 - Djikstra_'s Algorithm.mp412.88MB
- Design and Analysis of Algorithms/Week2/4 - 5 - Interpretation of the 3 Cases (11 min).mp413.12MB
- Design and Analysis of Algorithms/Week4/X/10 - 4 - BFS and Undirected Connectivity (13 min).mp413.7MB
- Design and Analysis of Algorithms/Week3/IX/9 - 2 - Graph Representations (14 min).mp413.81MB
- Design and Analysis of Algorithms/Week4/X/10 - 2 - Breadth-First Search (BFS)- The Basics (14 min).mp414.28MB
- Design and Analysis of Algorithms/Week2/4 - 3 - Examples (13 min).mp414.4MB
- Design and Analysis of Algorithms/Week1/I/1 - 4 - MergeSort-2 .mp415.01MB
- Design and Analysis of Algorithms/Week3/IX/9 - 1 - Graphs and Minimum Cuts (16 min).mp415.21MB
- Design and Analysis of Algorithms/Week2/4 - 6 - Proof II (16 min).mp416.6MB
- Design and Analysis of Algorithms/Week1/III/3 - 2 - O(n log n) Algorithm for Counting Inversions II (17 min).mp417.19MB
- Design and Analysis of Algorithms/Week1/I/1 - 6 - Guiding Principles for Analysis of Algorithms (15 min).mp418MB
- Design and Analysis of Algorithms/Week5/XII/12 - 2 - Heaps.mp418.63MB
- Design and Analysis of Algorithms/Week4/X/10 - 9 - Structure of the Web [Optional] (19 min).mp418.63MB
- Design and Analysis of Algorithms/Week1/I/1 - 1 - Introduction _ Why Study Algorithms _ (19 min).mp419.1MB
- Design and Analysis of Algorithms/Week1/III/3 - 5 - O(n log n) Algorithm for Closest Pair II [Advanced - Optional] (19 min).mp420.15MB
- Design and Analysis of Algorithms/Week5/XI/11 - 3 - Correctness of Dijkstra_'s Algorithm [Advanced - Optional] (19 min).mp420.31MB
- Design and Analysis of Algorithms/Week3/VIII/8 - 2 - Randomized Select Analysis (22 min).mp420.62MB
- Design and Analysis of Algorithms/Week5/XII/12 - 3 - Heaps.mp420.93MB
- Design and Analysis of Algorithms/Week5/XI/11 - 1 - Djikstra_'s Shortest-Path Algorithm (21 min).mp420.96MB
- Design and Analysis of Algorithms/Week3/VIII/8 - 1 - Randomized Select (22 min).mp421.4MB
- Design and Analysis of Algorithms/Week2/6 - 1 - Analysis I_ A Decomposition Principle [Advanced - Optional] (22 min).mp421.65MB
- Design and Analysis of Algorithms/Week2/5 - 4 - Choosing a Good Pivot (22min).mp421.74MB
- Design and Analysis of Algorithms/Week4/X/10 - 6 - Topological Sort (22 min).mp422.08MB
- Design and Analysis of Algorithms/Week4/X/10 - 1 - Graph Search - Overview (23 min).mp423.26MB
- Design and Analysis of Algorithms/Week1/III/3 - 3 - Strassen's Subcubic Matrix Multiplication Algorithm (22 min).mp423.57MB
- Design and Analysis of Algorithms/Week2/5 - 2 - Partitioning Around a Pivot (25 min).mp424.84MB
- Design and Analysis of Algorithms/Week2/7 - 1 - Part I [Review - Optional] (25 min).mp425.42MB
- Design and Analysis of Algorithms/Week5/XI/11 - 4 - Dijkstra_'s Algorithm.mp426.46MB
- Design and Analysis of Algorithms/Week4/X/10 - 8 - Computing Strong Components- The Analysis (26 min).mp426.77MB
- Design and Analysis of Algorithms/Week4/X/10 - 7 - Computing Strong Components- The Algorithm (29 min).mp429.5MB
- Design and Analysis of Algorithms/Week3/IX/9 - 4 - Analysis of Contraction Algorithm (30 min).mp429.83MB
- Design and Analysis of Algorithms/Week1/III/3 - 4 - O(n log n) Algorithm for Closest Pair I [Advanced - Optional] (32 min).mp432.12MB
友情提示
不会用的朋友看这里
把磁力链接复制到离线下载，或者bt下载软件里即可下载文件，或者直接复制迅雷链接到迅雷里下载！
亲，你造吗？将网页分享给您的基友，下载的人越多速度越快哦！
违规内容投诉邮箱：[email protected]
概述
838888磁力搜索是一个磁力链接搜索引擎，是学术研究的副产品，用于解决资源过度分散的问题
它通过BitTorrent协议加入DHT网络，实时的自动采集数据，仅存储文件的标题、大小、文件列表、文件标识符（磁力链接）等基础信息
838888磁力搜索不下载任何真实资源，无法判断资源的合法性及真实性，使用838888磁力搜索服务的用户需自行鉴别内容的真伪
838888磁力搜索不上传任何资源，不提供Tracker服务，不提供种子文件的下载，这意味着838888磁力搜索 838888磁力搜索是一个完全合法的系统