2007327

数据结构里面的KMP算法的可视化演示程序 MFC实现(Visualization of data structures inside the KMP algorithm demo program MFC implementation)

插入排序与合并排序的算法比较，比较两种算法的优劣(Comparison of insertion sort and merge)

这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)

邻接表存储图，然后进行深度优先遍历及广度优先遍历。(DFS,adjacent matrix)

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

主要用栈和树求解骑士问题，用C++语言编写的(The main stack and tree Cavalier Problem Solving with C++ languages)

C++中，对链表的增删改查的基本使用，值得学习(C++, on the list of CRUD basic use, it is worth learning)

在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.)

这个程序用来解决树结构与树之间的程序匹配的问题这个程序可以解决很多的问题(it is very good)

Monkeys and peach,Monkeys and peach(Monkeys and peach)