hill-climbing

将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现(Convert an array to Haffman code)

用分治算法（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))

本实验设有一个线性表，分别实现数组结构存储的原地逆置。为数据结构课程必做实验。(This experiment has a linear form, respectively, to achieve the storage array structure in situ reverse home. For the data structure courses will do the experiment.)

单链表的插入。数据结构中的算法小程序。初学者很适用。(Single-linked list insertion. Data structure of algorithm applet. Beginners are applicable.)

二叉树的设计。包含二叉树结点类的设计以及二叉树的遍历。(Binary tree design. Contains the binary tree node class design, and Binary Tree Traversal.)

二叉树的打包数据结构，包括遍历，删除，添加，注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)

队列的顺序存储结构和操作实现 队列的顺序存储结构和操作实现(The order of the queue storage structure and operation of the order of the realization of the queue storage structure and operation of the realization of)

说明：  贪婪算法的简单描述 不过没做完 只是想下个程序 用用。。。。 (greed math)

长整数四则运算,利用双向循环链表实现长整数的存储，每个结点含一个整形变量。 (Long integer arithmetic, the use of two-way circular linked list to achieve long integer storage, each node contains an integer variable.)

说明：  由数字1和0组成迷宫，0代表可走路径，程序会用坐标的形式给出每一步的走法(Composed by a maze of numbers 1 and 0, 0 to go the path, the program will use the coordinates given in the form of moves at each step)