Hanoi

已知二叉树的先序遍历结果，建立二叉树并输出其先序、中序、后序遍历结果(Build a binary tree and print the results of preorder, midorder and postorder traversals based on the known result of preorder traversal)

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

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

哈夫曼编码程序，实现计算编码学中哈夫曼编码程序的源代码。(Huffman coding procedures, the realization of computing science Huffman encoding procedure s source code.)

霍夫曼编码实验报告，内含源代码，编码原理 (Huffman coding lab report, containing the source code, coding theory)

改进爬山算法，用于风力发电机实现风能最大追踪，找到最佳叶尖速比，实现最大功率(modified hill-climbing algorithm for wind turbine with MPPT)

使用C语言编写的AOV网的拓扑排序，内附有详细的源码解释和输入示意图(Using C language AOV network topological sorting, enclosing a detailed explanation and input source diagram)

说明：  一个用VS2008编写的冒泡排序算法演示程序，数组都是随机生成的。(Bubble Sort)

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

用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出为最邻近距离的平方(Looking for n points nearest point, the output of the nearest neighbor distance squared using the divide-and-conquer algorithm (O (nlogn) complexity))