资源列表
HuffmanTree
- 包含了赫夫曼树编码译码所有具体过程（一整个工程）以及测试文档(It contains all the coding processes and testing documents.)
背包九讲-2.0
- 背包九讲，主要讲述DP相关的背包算法以备大家参考(Knapsack nine lectures, mainly about DP related knapsack algorithm, for your reference)
数组
- 用java描述常用数组排序如冒泡排序、直接排序、反转排序(Use Java to describe common array sort such as bubble sort, direct ordering, reverse ordering)
OJ参考答案
- 整理了西南科技大学OJ考试要求的全部80道数据结构AC代码(SWUST OJ data structure AC code)
Huffman Coding__V1
- 全套哈夫曼编码实验报告及代码 Huffman Coding__V1.doc Huffman.cpp 引用论文——哈夫曼树带权路径长度简便算法.pdf(A full set of Huffman coding experiment report and code Huffman Coding__V1.doc Huffman.cpp)
算法：C语言实现
- 这是数据结构的C语言代码实现，数据结构重算法思想，C语言实现起来会比较容易上手，适合初学者(This is the data structure of the C language code to achieve, data structure re-algorithm ideas, I personally feel better)
shunxubiao
- 利用数据结构链表实现图书信息管理，命名为SqList.cpp(Realization of library information management by using data structure linked list,It's called SqList.cpp)
最小生成树算法
- 最小生成树-Prim算法和Kruskal算法 详解(minimum spanning tree Prim and Kruskal)
8640希尔排序
- 用C语言言实现希尔排序。希尔排序(Shell Sort)是插入排序的一种。也称缩小增量排序，是直接插入排序算法的一种更高效的改进版本。(Using C language to achieve Hill sort.The Hill sort (Shell Sort) is a sort of insertion sort. Also called reduced delta sort is a more efficient version of the sorting algorithm dire
二叉树的基本操作
- 二叉树的先序，中序，后序，层序递归和非递归实现，总节点个数和叶子节点个数，二叉树的高度等基本操作(Two binary tree first order, middle order, backward sequence, sequence recursive and non recursive implementation, the total number of nodes and the number of leaf nodes, the height of the two fork tre
L1_06
- 对顺序表的一些基本操作(建表、插入、删除等)和具体的函数定义(Some basic operations of the sequential table (building table, insert, delete, etc.) and specific function definitions)
main
- 对一些超出整型数范围的正整数的应用，需要自己想办法解决的存储和运算。一种解决方案是用单链表存储一个正整数。注意，数字是用逆序存储的。试设计一个类处理任意大整数，必须实现输入输出操作、加法操作和赋值操作。(For some applications that are beyond the integer range of positive integers, they need to store and compute their own solutions. One solution is to