算法设计与分析.zip

上传者: 36247362 | 上传时间: 2021-09-05 19:33:33 | 文件大小: 2.65MB | 文件类型: ZIP
算法设计与分析PPT,一共有二十个PDF文件

文件下载

资源详情

[{"title":"( 22 个子文件 2.65MB ) 算法设计与分析.zip","children":[{"title":"算法设计与分析","children":[{"title":"L01-3-分治法-补充.pdf <span style='color:#111;'> 807.16KB </span>","children":null,"spread":false},{"title":"L08-最小生成树-Kruscal-算法.pdf <span style='color:#111;'> 54.93KB </span>","children":null,"spread":false},{"title":"L01-概述.pdf <span style='color:#111;'> 98.28KB </span>","children":null,"spread":false},{"title":"L09-Kruskal-不交的集合.pdf <span style='color:#111;'> 63.81KB </span>","children":null,"spread":false},{"title":"L14-分数背包-贪心算法.pdf <span style='color:#111;'> 50.25KB </span>","children":null,"spread":false},{"title":"L13-所有点对见最短路径-Flod-动态规划.pdf <span style='color:#111;'> 107.47KB </span>","children":null,"spread":false},{"title":"L18-P-NP问题.pdf <span style='color:#111;'> 162.09KB </span>","children":null,"spread":false},{"title":"L12-矩阵链相乘-动态规划.pdf <span style='color:#111;'> 119.46KB </span>","children":null,"spread":false},{"title":"L16-字符串匹配.pdf <span style='color:#111;'> 96.21KB </span>","children":null,"spread":false},{"title":"L20-近似算法.pdf <span style='color:#111;'> 61.40KB </span>","children":null,"spread":false},{"title":"L03-两个多项式相乘-分治法.pdf <span style='color:#111;'> 96.03KB </span>","children":null,"spread":false},{"title":"L15-哈夫曼编码-贪心算法.pdf <span style='color:#111;'> 90.13KB </span>","children":null,"spread":false},{"title":"L06-深度优先算法DFS及应用.pdf <span style='color:#111;'> 114.08KB </span>","children":null,"spread":false},{"title":"L07-最小生成树-Prim-算法.pdf <span style='color:#111;'> 123.78KB </span>","children":null,"spread":false},{"title":"L19-NP-完全问题.pdf <span style='color:#111;'> 136.21KB </span>","children":null,"spread":false},{"title":"L01-2-归并排序-递归树.pdf <span style='color:#111;'> 300.49KB </span>","children":null,"spread":false},{"title":"L10单源最短路径-Dijkstra-贪心.pdf <span style='color:#111;'> 122.61KB </span>","children":null,"spread":false},{"title":"L02-最大连续子序列-分治法.pdf <span style='color:#111;'> 81.89KB </span>","children":null,"spread":false},{"title":"L05-线性时间选择-最坏情况-分治法(不讲).pdf <span style='color:#111;'> 63.94KB </span>","children":null,"spread":false},{"title":"L04-线性时间选择-分治法.pdf <span style='color:#111;'> 99.76KB </span>","children":null,"spread":false},{"title":"L01-4-分治法-总结.pdf <span style='color:#111;'> 588.52KB </span>","children":null,"spread":false},{"title":"L11-0-1背包-动态规划.pdf <span style='color:#111;'> 74.48KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明