the-dynamic-planning

说明：  c编写的链表连接函数，上课时学的，上传试试 (c write the list to connect function, class, learn, try uploading)

一个很经典的问题_八数码! 算法速度快,解决问题多...有兴趣的可以(A very classic problem _ eight digital! Fast algorithm to solve the problem ... are interested in more than can be)

给定n种物品和一背包。物品i的重量是wi>0,价值为vi>0,背包的容量为c。选择装入背包的物品，使得装入背包中物品的总价值最大。(Given n kinds of goods and a backpack. Weight of the item i is wi> 0, the value of vi> 0, knapsack capacity c. Select the items into the backpack, so into the backpack of items in the total value of the maximum.)

在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)

数据结构中数据的排序示例,包括堆排序、快速排序等(Data structure to sort the data sample, including the heap sort, quick sort, etc.)

说明：  读取股票数据文件,C++源程序，非常好用。是学生做毕业设计的源料(Read the Stock Data File)

说明：  在给定的字母中，用c++来实现字母的排序(In a given letter, the use of c++ to implement the letter of the sort)

数字根算法，用最简单的代码计算数字根。如果把一个大数的各位数字相加得到一个和，再把这个和的各位数字相加又得一个和，再继续作数字和，直到最后的数字和是个位数为止，这最后的数称为最初那个数的“数字根”。(Digital root algorithm, with the most simple code to calculate the digital root. If you figure in a large numbers is the sum of a, then this and you figure the sum is again a, and then continue for digital and until the final figure and the single digits, the last number called initially that the number of "digital root".)

迷宫算法，1代表可以通过，0代表墙壁，自动找寻路线(Maze algorithm, 1 can pass 0 for the walls, automatically find routes)

说明：  根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)