资源列表
ww
- 数据结构C语言实现一元多项式运算-C language data structures to achieve a dollar polynomial computing
321
- 实现对图书的查找，删除，添加，以及合计。读者的借阅，归还，馆员管理-Realize the book to find, delete, add, and the total. Readers borrow, return, librarians Management
Text
- 程序名称：单词统计 程序功能：统计英文单词出现次数，并顺序输出-Program Name: Word statistics Program features: statistical occurrences of English words, and the output sequence
Chained-HashTable_Public_Interface
- < Mastering Algorithms with C>>链式哈希表的公共接口实现，所需的包含文件请下载本人的Singly-linked list公共接口-chained-hash table public interface for<<Mastering Algorithms with C>>，include files needed are available within my download-area
ArrayList
- 顺序存储结构线性表。实现在线性表上常用的运算： 初始化、求长度、取元素、查找、插入及删除等-Linear sequence table storage structure. Achieve common computing on a linear table: initialization, find the length, taking elements, search, insert, and delete
youxianjiduilie
- 优先级队列类的实现，可作为头文件直接调用。
mataqipan
- 能够实现马踏棋盘得算法运算 输入开始坐标点即可依次得到下个节点的坐标直到整个棋盘遍历完毕-Horse riding can be achieved board may enter a start coordinate point arithmetic operations can in turn be the coordinates of the next node until it has finished traversing the entire board
youlishu
- 有理数的四则运算，没有用到数据结构的知识，不过基本功能已经实现。-Rational numbers of arithmetic, there is no knowledge of data structures used, but the basic function has been achieved.
JOSEPHUS
- 约瑟夫环是一个数学的应用问题：已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。 -Josephus is the application of a mathematical problem: Given n individuals (in numbers 1,2,3 ... n, respectively) sitting around
zuixiaoshengchengshu
- 数据结构的初学者必须掌握的一点小知识，最小生成树。-Data structures for beginners must master a little knowledge, minimum spanning tree.
BST
- binary search tree recursion
HuffmanTree
- 霍夫曼编码是一种编码方式，是一种用于无损数据压缩的熵编码（权编码）算法。用变长编码表对源符号（如文件中的一个字母）进行编码，其中变长编码表是通过一种评估来源符号出现机率的方法得到的，出现机率高的字母使用较短的编码，反之出现机率低的则使用较长的编码，这便使编码之后的字符串的平均长度、期望值降低，从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding)