数据结构-何钦铭、陈越 课件资源

上传者: u012492017 | 上传时间: 2019-12-21 21:25:23 | 文件大小: 10.46MB | 文件类型: rar
数据结构-何钦铭、陈越 课件资源,浙江大学mook对=对应的ppt资源

文件下载

资源详情

[{"title":"( 41 个子文件 10.46MB ) 数据结构-何钦铭、陈越 课件资源","children":[{"title":"pdf课件","children":[{"title":"3.1 树与树的表示.pdf <span style='color:#111;'> 512.49KB </span>","children":null,"spread":false},{"title":"9.4散列表的性能分析.pdf <span style='color:#111;'> 251.75KB </span>","children":null,"spread":false},{"title":"4.1 二叉搜索树.pdf <span style='color:#111;'> 399.97KB </span>","children":null,"spread":false},{"title":"9.5应用实例(词频统计).pdf <span style='color:#111;'> 158.01KB </span>","children":null,"spread":false},{"title":"5.2-图的遍历.pdf <span style='color:#111;'> 120.32KB </span>","children":null,"spread":false},{"title":"6.3-拓扑排序.pdf <span style='color:#111;'> 116.89KB </span>","children":null,"spread":false},{"title":"4.4 哈夫曼树与哈夫曼编码.pdf <span style='color:#111;'> 526.54KB </span>","children":null,"spread":false},{"title":"8.2-表排序.pdf <span style='color:#111;'> 110.80KB </span>","children":null,"spread":false},{"title":"1.2-什么是算法.pdf <span style='color:#111;'> 134.70KB </span>","children":null,"spread":false},{"title":"2.1 线性表及其实现.pdf <span style='color:#111;'> 837.41KB </span>","children":null,"spread":false},{"title":"5.1-什么是图.pdf <span style='color:#111;'> 1.03MB </span>","children":null,"spread":false},{"title":"8.1-快速排序.pdf <span style='color:#111;'> 147.25KB </span>","children":null,"spread":false},{"title":"2.3 队列.pdf <span style='color:#111;'> 574.42KB </span>","children":null,"spread":false},{"title":"7.3-堆排序.pdf <span style='color:#111;'> 85.02KB </span>","children":null,"spread":false},{"title":"9.3冲突处理方法.pdf <span style='color:#111;'> 617.13KB </span>","children":null,"spread":false},{"title":"3.2 二叉树及存储结构.pdf <span style='color:#111;'> 469.99KB </span>","children":null,"spread":false},{"title":"7.2-希尔排序.pdf <span style='color:#111;'> 113.61KB </span>","children":null,"spread":false},{"title":"4.5 集合及运算.pdf <span style='color:#111;'> 272.76KB </span>","children":null,"spread":false},{"title":"10.3-附加条件的最短路.pdf <span style='color:#111;'> 85.54KB </span>","children":null,"spread":false},{"title":"6.2-最小生成树问题.pdf <span style='color:#111;'> 125.64KB </span>","children":null,"spread":false},{"title":"4.2 平衡二叉树.pdf <span style='color:#111;'> 438.56KB </span>","children":null,"spread":false},{"title":"2.2 堆栈.pdf <span style='color:#111;'> 709.23KB </span>","children":null,"spread":false},{"title":"10.6-散列映射逆问题.pdf <span style='color:#111;'> 89.24KB </span>","children":null,"spread":false},{"title":"3.3 二叉树的遍历.pdf <span style='color:#111;'> 497.97KB </span>","children":null,"spread":false},{"title":"2.4 应用实例--多项式加法运算.pdf <span style='color:#111;'> 204.10KB </span>","children":null,"spread":false},{"title":"7.1-简单排序.pdf <span style='color:#111;'> 156.11KB </span>","children":null,"spread":false},{"title":"5.3-应用实例:拯救007.pdf <span style='color:#111;'> 370.27KB </span>","children":null,"spread":false},{"title":"4.3 堆.pdf <span style='color:#111;'> 689.43KB </span>","children":null,"spread":false},{"title":"10.4-区分排序算法.pdf <span style='color:#111;'> 107.07KB </span>","children":null,"spread":false},{"title":"10.1-链表逆序.pdf <span style='color:#111;'> 101.42KB </span>","children":null,"spread":false},{"title":"5.4-应用实例:六度空间.pdf <span style='color:#111;'> 158.73KB </span>","children":null,"spread":false},{"title":"9.2散列函数的构造方法.pdf <span style='color:#111;'> 344.44KB </span>","children":null,"spread":false},{"title":"7.4-归并排序.pdf <span style='color:#111;'> 145.13KB </span>","children":null,"spread":false},{"title":"10.2-树的遍历.pdf <span style='color:#111;'> 85.76KB </span>","children":null,"spread":false},{"title":"10.5-环排序.pdf <span style='color:#111;'> 112.82KB </span>","children":null,"spread":false},{"title":"8.3-基数排序.pdf <span style='color:#111;'> 113.40KB </span>","children":null,"spread":false},{"title":"6.1-最短路径问题.pdf <span style='color:#111;'> 681.36KB </span>","children":null,"spread":false},{"title":"9.1散列表.pdf <span style='color:#111;'> 373.09KB </span>","children":null,"spread":false},{"title":"8.4-排序算法的比较.pdf <span style='color:#111;'> 71.43KB </span>","children":null,"spread":false},{"title":"1.1-什么是数据结构.pdf <span style='color:#111;'> 354.72KB </span>","children":null,"spread":false},{"title":"1.3-应用实例.pdf <span style='color:#111;'> 93.70KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]

评论信息

  • sucaixia :
    比较全,就是pdf格式,想要ppt的注意
    2019-08-20

免责申明

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