资源列表
The-Questions-of-Queues
- N皇后问题,介绍N皇后问题的工作原理，以及如何利用回溯法的工作思想来解决问题。-The Question Of Queues
index-tree
- 排序二叉树的改进，在每个节点上加一个值来统计该节点左边的结点个数，方便插入、删除和查找-Binary sort tree improvement, at each node with a value to the statistics of the node on the left side of the node number, convenient to insert, delete and search
FourArithmetic
- 精心编写的带有4个基本算法的程序，能加深大家对希尔排序、冒泡排序、快速排序、选择排序的理解，并清楚其中的区别，以及算法优劣性-Carefully prepared with a basic algorithm for four procedures, to strengthen the U.S. on the Hill sort, bubble sort, quick sort, selection sort of understanding, and clearly one of the di
bbTSP
- 货郎担问题的分支界限算法，c++实现-Branch and bound algorithm for Traveling Salesman Problem, c++ implementation. . .
nQueens
- 关于N皇后C++程序，这个程序运用了启发式搜索-heuristic search about n queens using C++
polymentail
- 一元多项式的运算，课程设计，大二,有完整的源码，学习交流使用-polynomial operation with specific codes
NBayse
- 朴素贝叶斯c++实现源码 实现了最基本的训练和测试过程-Bayesian source c++ Implementation
chapter-5
- 算法设计与分析 第5章 回溯法（讲解比较详细）-Algorithm Design and Analysis Chapter 5 backtracking (explain in more detail)
DesignPatternSrcCode
- 设计模式C++实现例子 很好用的啊,对学习设计模式很好用的 欢迎下载-design pattern c++
greed-bag
- 一个贪心背包的小程序可以在VC下运行,可作为算法学习参考- a greed bag algorithm implementation can run in VC
cm
- 利用C++语言 实现可变二维矩阵的算法，即把已经定义的二维矩阵变成认为可输入大小的矩阵-C++ language using a variable two-dimensional matrix algorithm, that is two-dimensional matrix has been defined that can be entered into a matrix of size
Knight
- 经典的骑士巡游问题，通过走日子来遍历棋盘，非回溯法，可以有效率的解决8*8棋盘的解决方案，但是不能保证所有问题都是有解的-Classic knight' s tour problem, by taking a day to traverse the board, non-backtracking, can be effective solution 8* 8 board solution, but can not guarantee that all problems are solvab