本站已收录 番号和无损神作磁力链接/BT种子 

Udemy - Algorithmic Problems in Python (2015)

种子简介

种子名称: Udemy - Algorithmic Problems in Python (2015)
文件类型: 视频
文件数目: 24个文件
文件大小: 623.51 MB
收录时间: 2017-3-8 03:42
已经下载: 3
资源热度: 110
最近下载: 2024-12-21 20:57

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:550b3dd8c6b319549aa442ecbef131c3a9563876&dn=Udemy - Algorithmic Problems in Python (2015) 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

Udemy - Algorithmic Problems in Python (2015).torrent
  • 01 Introduction/001 Introduction.mp43.87MB
  • 01 Introduction/002 Complexity theory introduction.mp456.22MB
  • 02 Backtracking/007 Coloring problem introduction.mp442.08MB
  • 02 Backtracking/012 Maze problem implementation.mp424.5MB
  • 02 Backtracking/011 Maze problem introduction.mp47.67MB
  • 02 Backtracking/006 Hamiltonian cycle implementation.mp429.42MB
  • 02 Backtracking/001 Backtracking introduction.mp413.74MB
  • 02 Backtracking/005 Hamiltonian problem - NP-hard problems.mp419.56MB
  • 02 Backtracking/003 N-queens problem implementation.mp415.46MB
  • 02 Backtracking/002 N-queens problem introduction.mp423.87MB
  • 02 Backtracking/010 Knight tour implementation.mp410.36MB
  • 02 Backtracking/008 Coloring problem implementation.mp427.46MB
  • 02 Backtracking/004 Hamiltonian cycle introduction.mp446.63MB
  • 02 Backtracking/009 Knight tour introduction.mp412.27MB
  • 03 Dynamic Programming/004 Coin change problem introduction.mp453.13MB
  • 03 Dynamic Programming/003 Fibonacci numbers implementation.mp415.37MB
  • 03 Dynamic Programming/001 Dynamic programming introduction.mp410.59MB
  • 03 Dynamic Programming/008 Knapsack problem introduction.mp428.89MB
  • 03 Dynamic Programming/007 Rod cutting problem implementation.mp412.77MB
  • 03 Dynamic Programming/005 Coin change problem implementation.mp420.24MB
  • 03 Dynamic Programming/006 Rod cutting problem introduction.mp448.59MB
  • 03 Dynamic Programming/010 Knapsack problem implementation.mp429.36MB
  • 03 Dynamic Programming/002 Fibonacci numbers introduction.mp417.16MB
  • 03 Dynamic Programming/009 Knapsack problem example.mp454.29MB