资源列表
paixu
- 数据结构与算法分析——排序例程，其中包含插入排序，归并排序，快速排序-Data Structures and Algorithm Analysis- sort routine, which includes insertion sort, merge sort, quick sort
lianbiao
- 数据结构与算法分析——链表例程，包括单向链表的建立，查找，倒置-Data structures and algorithm analysis- list routine, including the establishment of one-way linked list, find, inverted
zhan
- 数据结构与算法分析——栈实验，要求将某个十进制转换成八进制或二进制，根据栈的特点可以实现进制转换的算法-Data structures and algorithm analysis- stack test, request to convert an octal, decimal or binary, according to the characteristics of the stack algorithm can hex conversion
Binary-Tree
- 本程序实现了对二叉树的前、中、后和层序的遍历-The program realization of the binary tree before, during, and after the traversal sequence
gradient-descent
- 本程序用C++语言实现了梯度下降的功能-Program for the degree of gradient algorithm
matrix-inversion
- 本程序实现了矩阵求逆的功能，也是用C++语言的，简单详细-This program implements the function of matrix inversion, but also with C++ language, simple details
Prim
- 本程序实现最短路径中的一个算法，prim算法、。-The program realization of a shortest path algorithm, prim algorithm.
LD
- 又称Levenshtein距离（也叫做Edit Distance），是指两个字串之间，由一个转成另一个所需的最少编辑操作次数。许可的编辑操作包括将一个字符替换成另一个字符，插入一个字符，删除一个字符。 -Also known as Levenshtein distance (also known as Edit Distance), is between two strings, one by one turned into the minimum required number of edit
LCS
- 最长公共子序列也称作最长公共子串(不要求连续)，英文缩写为LCS（Longest Common Subsequence）。其定义是，一个序列 S ，如果分别是两个或多个已知序列的子序列，且是所有符合此条件序列中最长的，则 S 称为已知序列的最长公共子序列-Longest common subsequence, also known as the longest common strings (does not require continuous), the English abbreviat
yinhang
- 自己写的银行家算法，有需要的可以看下，简单易懂。-Bankers to write their own algorithms, we need to look down, easy to understand.
CPPK-means
- K均值聚类首先需要确定聚成几类，然后按照迭代的方法，计算类的重心，然后按照向量和类重心的聚类重新分类，反复重复，直到分类稳定或者重心稳定。-K means clustering first need to identify clustered into several categories, and then follow the iterative method to calculate the focus of the class, and then follow the center of
huffman
- 实现哈夫曼编码的实验代码，选修课多媒体技术实验验收版。-The experimental realization of Huffman code, test and acceptance of multimedia technology elective version.