d

匈牙利算法以及指派问题介绍，kM算法和匈牙利算法的程序代码(Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code)

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

平衡二叉树操作，可以输入数字形成二叉树，可以进行添加、删除操作(Balanced binary tree operation, you can enter numbers to form a binary tree, the user can add, delete)

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

POJ141的源代码，以空间换时间，速度很快很好用。(POJ141 the source code for time in space, fast easy to use.)

Huffman编码与译码，实现数据结构树的功能。(Huffman coding and decoding, data structure tree functions.)

程序可以实现哈弗曼自动编码功能！很详细的！很有参考价值！(Program can be Havermann automatic coding features! Very detailed! A good reference!)

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

使用的排序算法，非常不错的思维，比较其他有较大优势(Sorting algorithm used, very good ideas, have greater advantages compared with other)

题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)