[{"title":"( 59 个子文件 37KB ) 算法设计与分析 书本所有程序源码 ——C++代码","children":[{"title":"算法设计与分析-所有程序源码","children":[{"title":"第5章 减治法","children":[{"title":"淘汰冠军问题.cpp <span style='color:#111;'> 512B </span>","children":null,"spread":false},{"title":"假币问题.cpp <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"两个序列的中位数.cpp <span style='color:#111;'> 989B </span>","children":null,"spread":false},{"title":"堆排序.cpp <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"插入排序.cpp <span style='color:#111;'> 366B </span>","children":null,"spread":false},{"title":"折半查找.cpp <span style='color:#111;'> 658B </span>","children":null,"spread":false},{"title":"选择问题.cpp <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"二叉查找树.cpp <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false}],"spread":true},{"title":"第3章 蛮力法","children":[{"title":"选择排序.cpp <span style='color:#111;'> 571B </span>","children":null,"spread":false},{"title":"最近点对.cpp <span style='color:#111;'> 716B </span>","children":null,"spread":false},{"title":"串匹配BF算法.CPP <span style='color:#111;'> 702B </span>","children":null,"spread":false},{"title":"串匹配KMP.CPP <span style='color:#111;'> 1.44KB </span>","children":null,"spread":false},{"title":"凸包问题.cpp <span style='color:#111;'> 792B </span>","children":null,"spread":false},{"title":"百元买百鸡问题.cpp <span style='color:#111;'> 751B </span>","children":null,"spread":false},{"title":"顺序查找.cpp <span style='color:#111;'> 682B </span>","children":null,"spread":false}],"spread":true},{"title":"第6章 动态规划法","children":[{"title":"近似串匹配问题.cpp <span style='color:#111;'> 904B </span>","children":null,"spread":false},{"title":"多源点最短路径问题.cpp <span style='color:#111;'> 770B </span>","children":null,"spread":false},{"title":"最长递增子序列.cpp <span style='color:#111;'> 1.14KB </span>","children":null,"spread":false},{"title":"最优二叉查找树.cpp <span style='color:#111;'> 1.10KB </span>","children":null,"spread":false},{"title":"0-1背包问题.cpp <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"数塔问题.cpp <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"最长公共子序列问题.cpp <span style='color:#111;'> 1.22KB </span>","children":null,"spread":false},{"title":"多段图的最短路径问题.cpp <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false}],"spread":true},{"title":"第7章 贪心法","children":[{"title":"埃及分数.cpp <span style='color:#111;'> 1.07KB </span>","children":null,"spread":false},{"title":"最小生成树PRIM.cpp <span style='color:#111;'> 1.22KB </span>","children":null,"spread":false},{"title":"TSP最近邻点.cpp <span style='color:#111;'> 977B </span>","children":null,"spread":false},{"title":"图着色问题.cpp <span style='color:#111;'> 711B </span>","children":null,"spread":false},{"title":"多机调度问题.cpp <span style='color:#111;'> 965B </span>","children":null,"spread":false},{"title":"背包问题.cpp <span style='color:#111;'> 675B </span>","children":null,"spread":false},{"title":"活动安排问题.cpp <span style='color:#111;'> 844B </span>","children":null,"spread":false}],"spread":true},{"title":"第4章 分治法","children":[{"title":"最近对问题.cpp <span style='color:#111;'> 2.30KB </span>","children":null,"spread":false},{"title":"数字旋转方阵.cpp <span style='color:#111;'> 1.69KB </span>","children":null,"spread":false},{"title":"Fibonacci序列.cpp <span style='color:#111;'> 213B </span>","children":null,"spread":false},{"title":"棋盘覆盖问题.cpp <span style='color:#111;'> 1.70KB </span>","children":null,"spread":false},{"title":"最大字段和问题.cpp <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"汉诺塔问题.cpp <span style='color:#111;'> 497B </span>","children":null,"spread":false},{"title":"归并排序.cpp <span style='color:#111;'> 1.19KB </span>","children":null,"spread":false},{"title":"快速排序.cpp <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false}],"spread":true},{"title":"第2章 算法分析基础","children":[{"title":"数组中求最小元素.cpp <span style='color:#111;'> 308B </span>","children":null,"spread":false},{"title":"起泡排序的比较和移动次数.cpp <span style='color:#111;'> 832B </span>","children":null,"spread":false},{"title":"合并排序.cpp <span style='color:#111;'> 694B </span>","children":null,"spread":false},{"title":"冒泡排序.cpp <span style='color:#111;'> 764B </span>","children":null,"spread":false},{"title":"顺序查找.cpp <span style='color:#111;'> 446B </span>","children":null,"spread":false}],"spread":true},{"title":"第12章 概率算法","children":[{"title":"洗牌.cpp <span style='color:#111;'> 630B </span>","children":null,"spread":false},{"title":"随机快速排序.cpp <span style='color:#111;'> 1.40KB </span>","children":null,"spread":false},{"title":"主元素问题.cpp <span style='color:#111;'> 698B </span>","children":null,"spread":false},{"title":"素数测试问题.cpp <span style='color:#111;'> 718B </span>","children":null,"spread":false},{"title":"八皇后问题.cpp <span style='color:#111;'> 1.71KB </span>","children":null,"spread":false},{"title":"整数因子划分.cpp <span style='color:#111;'> 1.09KB </span>","children":null,"spread":false}],"spread":true},{"title":"第11章 近似算法","children":[{"title":"装箱问题.cpp <span style='color:#111;'> 737B </span>","children":null,"spread":false},{"title":"子集和问题.cpp <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"求PI的近似值.cpp <span style='color:#111;'> 753B </span>","children":null,"spread":false}],"spread":true},{"title":"第1章 算法设计基础","children":[{"title":"短除法求最大公约数.cpp <span style='color:#111;'> 490B </span>","children":null,"spread":false},{"title":"欧几里德算法求最大公约数.cpp <span style='color:#111;'> 452B </span>","children":null,"spread":false}],"spread":true},{"title":"第8章 回溯法","children":[{"title":"素数环.cpp <span style='color:#111;'> 1.29KB </span>","children":null,"spread":false},{"title":"哈密顿回路.cpp <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false},{"title":"图着色问题.cpp <span style='color:#111;'> 973B </span>","children":null,"spread":false},{"title":"八皇后问题.cpp <span style='color:#111;'> 2.12KB </span>","children":null,"spread":false},{"title":"批处理作业调度.cpp <span style='color:#111;'> 1.44KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]