资源列表
dblink_list
- 使用C语言，构成双向链表，实现双向链表的增删改查功能(C language is used to form a two-way linked list, so as to realize the function of adding and deletions and changing functions of two-way linked list.)
sequeue
- 使用C语言，构成队列，实现队列的入队以及出队操作(The use of C language, a queue, queue enqueue and dequeue operations)
linkstack
- 使用C语言，构成链表栈，实现链表栈的增删改查功能(C language is used to form linked list stack, so that we can add and delete functions of linked list stack.)
字符串插入块链实现
- 输入一串字符串，程序自动分割成8个一串的块链。整个程序通过链表实现，还可实现插入字符串功能。(Input a string of characters, the program is automatically divided into 8 string blocks. The whole program is implemented through linked list, and the function of inserting string is also realized.)
二叉树的遍历
- 主要实现：创建二叉树、用先中后序遍历二叉树（中序，先序和后序遍历用非递归实现），并输出树高。(The main achievement is to create two branches tree, and use the first and middle traversal to traverse the two fork tree.)
哈夫曼树
- 主要实现：创建一颗哈夫曼树，并输出每个节点的哈夫曼编码。(The main achievement is to create a Huffman tree and output Huffman coding for each node.)
希尔排序
- 希尔排序(Shell Sort)是插入排序的一种。也称缩小增量排序，是直接插入排序算法的一种更高效的改进版本。希尔排序是非稳定排序算法。该方法因DL．Shell于1959年提出而得名。 希尔排序是把记录按下标的一定增量分组，对每组使用直接插入排序算法排序；随着增量逐渐减少，每组包含的关键词越来越多，当增量减至1时，整个文件恰被分成一组，算法便终止。(Hill sorting (Shell Sort) is a sort of insertion sort. Also known as narr
heap
- 数据结构中堆排序利用了大根堆（或小根堆）堆顶记录的关键字最大（或最小）这一特征，使得在当前无序区中选取最大（或最小）关键字的记录变得简单。(Heap sorting in data structures, building the largest (smallest) heap)
实验2第一个程序
- 1. 编写线性表初始化函数：Status InitList_Sq(SqList *L); 2. 编写求线性表长度函数：Status ListLength(SqList *L); 3. 编写在第i个位置前插入元素函数：Status ListInsert_Sq(SqList *L, int i, ElemType e); 4. 编写删除第i个元素函数：Status ListDelete_Sq(SqList *L, int i, ElemType *e); 5. 编写获取某个位置的元素函数：Statu
Huffman编码树
- 该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码。(This method is based on the probability of character appearance to construct the shortest mean length of the head, sometimes called the best encoding, which is generally called the Huffman code.
huffmanTree
- 赫夫曼树的创建，以及Huffman编码与字符之间的相互转换(The creation of Huffman tree, and the conversion between Huffman coding and characters.)
无向图
- 无向图的创建，转化为邻接矩阵输出，及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)