资源列表
Sort
- 数据结构相关的多种排序算法，冒泡，快排，二叉树等(A variety of sorting algorithms related to data structure)
mystack
- 顺序结构实现的栈，使用面向对象的c++语言。(The stack of array implementation)
数据结构与算法代码
- 链式求解约瑟夫问题，这个使用c++实现，通过模板类是扩展性更强(Solving Joseph problem by chain type)
MERGE
- Algorithm Merge in language C
ARVORE
- Source code of Tree implementation
实验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.
python algorithms
- 用python语言实现的常用算法，很适合小白学习入门(Common algorithms implemented in Python language)
哈夫曼编码译码
- 哈夫曼编码译码，学习数据结构二叉树的一个应用，解压压缩软件的基础，哈夫曼编码(Huffman encoding and decoding, learning data structure, an application of two branch tree, decompressing the basis of compression software, Huffman coding.)
mul
- 数字比较大，相乘的结果超出了基本类型的表示范围，不能够直接做乘法运算。(Two large numbers multiplied and printed results)
二叉树遍历
- Two forked tree traversing Two forked tree traversing
Dijkstra求最短路径
- dijkstra suanfa dijkstra suanfa