Data Structures and Program Design in C++ by Robert Kruse, Alexander Ryba 源代码

哈夫曼树算法 根据给定的n个权值{w1,w2,……wn}，构造n棵只有根结点的二叉树，令起权值为wj 在森林中选取两棵根结点权值最小的树作左右子树，构造一棵新的二叉树，置新二叉树根结点权值为其左右子树根结点权值之和 在森林中删除这两棵树，同时将新得到的二叉树加入森林中 重复上述两步，直到只含一棵树为止，这棵树即哈夫曼树 -Huffman tree algorithm based on a given n-weights (w1, w2, ... ... wn), construct n trees only a root node of the tree, so that from the right value of wj in the forest root node to select two the right tree for the value of the smallest subtree around, a new binary tree structure, the right to buy a new tree root node value of its subtree root node around the right value in the forest and delete these two trees, At the same time, the new binary tree obtained by adding the forest to repeat the above two steps until a tree containing only the date, that is, Huffman tree tree

在计算机科学中，链表是；

清华版数据结构实验要求的的哈希算法原程序-version Qinghua Experimental data structure requirements of the original Hash Algorithm procedures

约瑟夫环 约瑟夫环 约瑟夫环 约瑟夫环-the circle of Joysef

java中几种常用的排序算法。 用Java语言实现的各种排序，包括插入排序、冒泡排序、选择排序、Shell排序、快速排序、归并排序、堆排序、SortUtil等。-java of several commonly used sorting algorithm. Using Java language to achieve a variety of sorting, including the Insertion Sort, Bubble Sort, Selection Sort, Shell Sort, Quick Sort, Merge Sort, Heap Sort, SortUtil such.

64位以内Rabin-Miller 强伪素数测试和Pollard rho 因数分解算法的实现-64 within Rabin-Miller-puppet prime testing and Pollard rho factorization algorithm implementation

BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.

DELPHI+ACCESS 客户关系管理-DELPHI+ ACCESS Customer Relationship Management

C语言常用算法源代码,数据结构原理实现， 对学习应用有参考价值。-C language source code commonly used algorithms and data structures to achieve the principle of learning about the application of a reference value.

数据结构最短路径，Turboc2下通过编译-the datasructure of the shortest way,run successfully in turbo2.