算法导论——所有算法和数据结构的C++实现
所有代码都是在我学习这本书时亲手敲出来的，并且调试正确了，包括：第三部分到第六部分（即10-26章），外加第七部分31和32章所有的算法和数据结构以及编程习题还有思考题的C++实现源代码；
第一、二部分学习的较早，代码已丢失；
如果程序有问题，欢迎在我的博客留言或者发邮件1372120340@qq.com
某些章内容可以参考我的博客（http://blog.csdn.net/zilingxiyue），由于时间关系，而且写一篇博客要花费很多精力，所有并没有写完（只有32篇），抱歉。
文件下载
资源详情
[{"title":"（ 78 个子文件 471KB ） 算法导论——所有算法和数据结构的C++实现","children":[{"title":"C_plus_plus_Primer","children":[{"title":"FibonacciHeap.h <span style='color:#111;'> 8.42KB </span>","children":null,"spread":false},{"title":"high_precision_computation.cpp <span style='color:#111;'> 4.24KB </span>","children":null,"spread":false},{"title":"MinmumGapTree.cpp <span style='color:#111;'> 11.82KB </span>","children":null,"spread":false},{"title":"Ford_Fulkerson.cpp <span style='color:#111;'> 4.76KB </span>","children":null,"spread":false},{"title":"Matrix_graph.cpp <span style='color:#111;'> 3.43KB </span>","children":null,"spread":false},{"title":"prim.txt <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"Young_Matrix.cpp <span style='color:#111;'> 3.72KB </span>","children":null,"spread":false},{"title":"ChangeCoin16_1.cpp <span style='color:#111;'> 2.15KB </span>","children":null,"spread":false},{"title":"SystemOfDiffrenceConstraints.cpp <span style='color:#111;'> 5.23KB </span>","children":null,"spread":false},{"title":"Chinese_remainder_theorem.cpp <span style='color:#111;'> 1.49KB </span>","children":null,"spread":false},{"title":"huffman.cpp <span style='color:#111;'> 2.72KB </span>","children":null,"spread":false},{"title":"TopicLinkList.cpp <span style='color:#111;'> 6.70KB </span>","children":null,"spread":false},{"title":"22_5StronglyConnectedCompenents.cpp <span style='color:#111;'> 9.41KB </span>","children":null,"spread":false},{"title":"B_Tree.cpp <span style='color:#111;'> 13.06KB </span>","children":null,"spread":false},{"title":"DynamicProgramming_Algorithms.cpp <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"IntervalTree.cpp <span style='color:#111;'> 11.91KB </span>","children":null,"spread":false},{"title":"RadixTree_0_1_StringsSort.cpp <span style='color:#111;'> 1.15KB </span>","children":null,"spread":false},{"title":"editDistance.cpp <span style='color:#111;'> 3.78KB </span>","children":null,"spread":false},{"title":"Adjlist_graph.cpp <span style='color:#111;'> 6.13KB </span>","children":null,"spread":false},{"title":"DoubleLinkList_ArrayImplementation.cpp <span style='color:#111;'> 3.21KB </span>","children":null,"spread":false},{"title":"GenericPush-RelabelMaximumFlow.cpp <span style='color:#111;'> 4.57KB </span>","children":null,"spread":false},{"title":"DFS_application.cpp <span style='color:#111;'> 5.79KB </span>","children":null,"spread":false},{"title":"Fibonacci_Algorithms.cpp <span style='color:#111;'> 1.58KB </span>","children":null,"spread":false},{"title":"TaskSchedulingProblem.cpp <span style='color:#111;'> 2.15KB </span>","children":null,"spread":false},{"title":"Wrestler.cpp <span style='color:#111;'> 2.99KB </span>","children":null,"spread":false},{"title":"QuickSort.cpp <span style='color:#111;'> 2.21KB </span>","children":null,"spread":false},{"title":"binomial_heap_implements_MST.cpp <span style='color:#111;'> 5.02KB </span>","children":null,"spread":false},{"title":"PointOverlapMaximumTree.cpp <span style='color:#111;'> 11.78KB </span>","children":null,"spread":false},{"title":"22_4TopSort.cpp <span style='color:#111;'> 4.75KB </span>","children":null,"spread":false},{"title":"BinaryHeap.cpp <span style='color:#111;'> 5.28KB </span>","children":null,"spread":false},{"title":"C_plus_plus_11_traits.cpp <span style='color:#111;'> 12.87KB </span>","children":null,"spread":false},{"title":"prime.cpp <span style='color:#111;'> 2.09KB </span>","children":null,"spread":false},{"title":"MotionOnChekerboard.cpp <span style='color:#111;'> 2.85KB </span>","children":null,"spread":false},{"title":"AVLTree.cpp <span style='color:#111;'> 7.76KB </span>","children":null,"spread":false},{"title":"OrderlyStatisticTree.cpp <span style='color:#111;'> 12.39KB </span>","children":null,"spread":false},{"title":"Modular_Exponentiation.cpp <span style='color:#111;'> 937B </span>","children":null,"spread":false},{"title":"PrettyPrinting.cpp <span style='color:#111;'> 1.66KB </span>","children":null,"spread":false},{"title":"Number_Theory_Algorithms.cpp <span style='color:#111;'> 2.87KB </span>","children":null,"spread":false},{"title":"DynamicProgrammingAlgorithms.cpp <span style='color:#111;'> 11.69KB </span>","children":null,"spread":false},{"title":"Greedy16_1_3__many_classroom.cpp <span style='color:#111;'> 3.10KB </span>","children":null,"spread":false},{"title":"Treap.cpp <span style='color:#111;'> 8.95KB </span>","children":null,"spread":false},{"title":"Hash_table_open_addressing.cpp <span style='color:#111;'> 3.28KB </span>","children":null,"spread":false},{"title":"B_Tree_Plus.cpp <span style='color:#111;'> 19.40KB </span>","children":null,"spread":false},{"title":"SingleSourceShortestPath.cpp <span style='color:#111;'> 7.91KB </span>","children":null,"spread":false},{"title":"string_matcher","children":[{"title":"naive_string _matcher.cpp <span style='color:#111;'> 1.96KB </span>","children":null,"spread":false},{"title":"finite_automaton_matcher.cpp <span style='color:#111;'> 2.39KB </span>","children":null,"spread":false},{"title":"KMP.cpp <span style='color:#111;'> 1.73KB </span>","children":null,"spread":false},{"title":"Rabin_Karp_matcher.cpp <span style='color:#111;'> 1.91KB </span>","children":null,"spread":false}],"spread":false},{"title":"doc","children":[{"title":"利用单指针域实现双链表.docx <span style='color:#111;'> 118.41KB </span>","children":null,"spread":false},{"title":"找硬币.docx <span style='color:#111;'> 16.28KB </span>","children":null,"spread":false},{"title":"D.docx <span style='color:#111;'> 142.68KB </span>","children":null,"spread":false},{"title":"思考题 23.docx <span style='color:#111;'> 17.36KB </span>","children":null,"spread":false},{"title":"贪吃蛇.txt <span style='color:#111;'> 18.68KB </span>","children":null,"spread":false},{"title":"16.2-6.docx <span style='color:#111;'> 14.45KB </span>","children":null,"spread":false},{"title":"编辑距离.doc <span style='color:#111;'> 49.50KB </span>","children":null,"spread":false},{"title":"通用的汇.docx <span style='color:#111;'> 17.19KB </span>","children":null,"spread":false}],"spread":false},{"title":"Johnson.cpp <span style='color:#111;'> 6.21KB </span>","children":null,"spread":false},{"title":"MinimumSpanningTree.cpp <span style='color:#111;'> 5.83KB </span>","children":null,"spread":false},{"title":"breadth_first_search.cpp <span style='color:#111;'> 3.42KB </span>","children":null,"spread":false},{"title":"SinglePointerDoubleLinkList.cpp <span style='color:#111;'> 4.25KB </span>","children":null,"spread":false},{"title":"BinarySearchTree.cpp <span style='color:#111;'> 10.17KB </span>","children":null,"spread":false},{"title":"Tarjan_LCA.cpp <span style='color:#111;'> 2.72KB </span>","children":null,"spread":false},{"title":"MinimumSpanningTree_23_2.cpp <span style='color:#111;'> 8.59KB </span>","children":null,"spread":false},{"title":"DisjointSet.cpp <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"GreedyAlgorithms.cpp <span style='color:#111;'> 10.92KB </span>","children":null,"spread":false},{"title":"RedBlackTree_Plus.cpp <span style='color:#111;'> 12.90KB </span>","children":null,"spread":false},{"title":"DoubleCircularLinkList.cpp <span style='color:#111;'> 5.03KB </span>","children":null,"spread":false},{"title":"The_schedule_of_minimize_average_finish_time.cpp <span style='color:#111;'> 2.46KB </span>","children":null,"spread":false},{"title":"AllPairsShortestPaths.cpp <span style='color:#111;'> 4.91KB </span>","children":null,"spread":false},{"title":"BinomialHeap.cpp <span style='color:#111;'> 8.36KB </span>","children":null,"spread":false},{"title":"Hash_table_chaining.cpp <span style='color:#111;'> 3.76KB </span>","children":null,"spread":false},{"title":"inversion.cpp <span style='color:#111;'> 1.02KB </span>","children":null,"spread":false},{"title":"RedBlackTree.cpp <span style='color:#111;'> 10.52KB </span>","children":null,"spread":false},{"title":"The_diameter_of_Tree.cpp <span style='color:#111;'> 3.25KB </span>","children":null,"spread":false},{"title":"MemmoryAllocatorTemplate.cpp <span style='color:#111;'> 2.15KB </span>","children":null,"spread":false},{"title":"LinkList.cpp <span style='color:#111;'> 4.44KB </span>","children":null,"spread":false},{"title":"PlanningCompanyParty.cpp <span style='color:#111;'> 2.09KB </span>","children":null,"spread":false},{"title":"huffman_012coding.cpp <span style='color:#111;'> 2.94KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}]
评论信息
其他资源
- QCustomPlot中用直线标示曲线的值
- 区间运算加减乘除Matlab代码
- C#中国象棋单机版.zip
- 奈曼皮尔逊准则matlab仿真
- 基于深度卷积神经网络图像去噪算法
- simulink的使用手册（全）
- SM3密码算法c语言实现
- C#版asp.net在线考试系统(可用作课程设计)
- java开发的商店收银系统
- AGV调度系统地图建模参考文件 c++
- python爬取情话源码
- 重庆理工大学《概率论与数理统计》5套期末复习题（含答案）.pdf
- 硬盘数据恢复软件（PowerDataRecovery）v4[1].1.2.rar
- GA∕T 74-2017 安全防范系统通用图形符号（CAD）
- 影式_易语言模块反编译工具
- 千兆以太网通信驱动模块（verilog）
- WebGIS原理与实践-实习代码
- TIA Portal V15 免usb硬件狗补丁
- 个人信息统计 小程序
- 上海市区县行政边界sho
- SQLite管理系统
免责申明
【只为小站】的资源来自网友分享，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论 【只为小站】 经营者是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明
本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二条之规定，若资源存在侵权或相关问题请联系本站客服人员，zhiweidada#qq.com，请把#换成@，本站将给予最大的支持与配合，做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明