huffman

基于数据结构的图书管理系统，基本功能都有，可以拿来作为数据结构的课程设计(Based library management system data structures, basic function, can be used as a data structure of the curriculum design)

数据结构使用三叉链表表示的二叉树的基本操作(Data structures using the binary tree expressed in the trigeminal lists the basic operation of)

数据结构 堆栈 实现了以下功能： cout<<"----------------主菜单---------------"<<endl <<"* 1.建立 *"<<endl <<"* 2.输出 *"<<endl <<"* 3.判断栈是否为空 *"<<endl <<"* 4.栈的长度 *"<<endl <<"* 5.输出栈顶元素 *"<<endl <<"* 6.进栈 *"<<endl <<"* 7.出栈 *"<<endl <<"* 8.遍历 *"<<endl <<"* 9.数制转换 *"<<endl <<"* 10.清空 *"<<endl <<"* 11.销毁 *"<<endl <<"* 12.退出 *"<<endl <<"--------------------------------------"<<endl<<endl (data structure stack)

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

讲述数据机构的图论部分和程序设计的关系，适合学习算法的同学学习阅读，很不错的一本书。(Graph theory algorithm and programming)

数据结构一书上 关于迷宫游戏的算法 (Book on data structure algorithms on maze game)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)

已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)

说明：  斐波那契 式子计算，属于算法类的 用于VC6.0++(Fibonacci calculation formulas, algorithms are used to VC6.0++ class)