资源列表
Queue_string
- 菜鸟自己写的一个存储字符串的循环队列，字符串长度可自定义，遍历方式是一个个输出的。-Circular queue rookie wrote a stored string, the string length can be customized traversal is one of the output.
huffman_tree
- 数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。-Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.
link_queue
- 提供数据结构中的链队列类。队列的链接存储结构是用一个单链表存放队列元素的。压缩包中有测试文件。-Provide data structure chain queue class. Queue storage structure is linked with a single list of elements stored in the queue. Compressed package test files.
seq_list
- 数据结构，线性表的顺序存储方式,压缩包中提供了一个顺序表类和一些辅助函数，还有一个测试程序-Sequential storage data structures, linear form. The compressed package provides an order form classes and some auxiliary functions.It also has a test program.
11c
- 本代码用单链表实现大数据的储存，可处理任意大的整数，实现输入输出操作-just like
ShellInsert
- 这个程序里面包括有希尔排序，快速排序，堆排序，归并排序。-This program which includes Hill sort, quick sort, heap sort, merge sort.
Linear-table-_-circular-linked-list
- 循环链表，有以下几项功能：列举表元素，插入、删除元素，清空表，查询元素值，查询元素位置，列举前驱和后继元素，退出程序。-The circular list, has the following functions: lists of elements, insert, delete elements, empty table, query element values, query element position, list of previous and subsequent element
polyn
- 用链表实现的一元多项式的加、减、乘、除、求值、求导、定积分-Achieve with a polynomial of addition, subtraction, multiplication, division, evaluation, derivation, definite integrals
Linear-table-_-endless-chain-said
- 不创建头结点的链表。满足以下功能：列举表元素，插入、删除元素，清空表，查询元素值，查询元素位置，列举前驱元素，列举后继元素，退出程序。-Do not create a head node of the list. Meet the following functions: lists of elements, insert, delete elements, empty table, query element values, query element position, list of pr
Linear-table-_-leading-chain-said
- 将第一个结点作为一个特殊的结点，不用来存储数据的链表-The first node as a special node is not used to store data list
k-means
- k-均值聚类算法（C语言实现）： 给定类的个数K，将N个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。-k-means clustering algorithm (C language): given the number of classes K, N objects will be assigned to the K class, making the class the biggest similarity between objects, and the s
Lcs
- 求最长公共子序列。本算法使用动态规划算法，解得最长公共子序列问题。-Find the longest common subsequence. The algorithm uses a dynamic programming algorithm, the solution was the longest common subsequence problem.