资源列表
LexOrder
- 对于给定的$n$, 生成$[n]$的所有排列的算法。采用字典序编码。-given for the $ $ n, generating $ $ [n] all with the algorithm. Using the dictionary coding sequence.
Cpp2
- 王晓东 算法第五章课后习题 罗密欧与朱丽叶的回溯算法-Xiaodong algorithm Exercises Chapter V Romeo and Juliet after the backtracking algorithm
Niudun
- 这是计算方法中的一个实验，其主要功能是实现牛顿迭代和牛顿插值-This is an experiment in the calculation, and its main function is to achieve Newton and Newton Interpolation
hurst_exponent
- 使用经典R/S方法计算赫斯特指数，以衡量数据的分型特性-using R/S method to caculate the Hurst exponent
jiujiu
- 创建一个线性表，并实现线性表的插入及删除操作-Create a linear form, and to achieve a linear table insert and delete operations
Traverse
- 数据结构中的树的遍历，用栈的存取方式，存地址，也可以说是下标了.用VC++实现-The data structure of tree traverse, with vc++ realized
dongtaiguihuqiubeibaowenti
- 动态规划求0/1背包问题,是一个或多个物品的重量和价值,数组中的每个元素定义一趟需要记录的数据-Dynamic programming 0/1 knapsack problem is the weight and value of one or more items, each array element defines a trip record data
1002
- poj1002代码，考虑的比较全面，值得推荐，互相学习-poj1002 code
kurajss
- This the basic algorithm for DFS and BFS-This is the basic algorithm for DFS and BFS
Tree
- 源程序（C语言）对二叉树进行了一些基础操作，包括二叉树的初始化，遍历（先序）输入，凹入表输出等。-Source code (C language) had some basis for binary operations, including the initialization of a binary tree traversal (first order) input, recessed table output.
xishujuzhnedezhuanzhiyucunchu
- 通过三元组和快速转置两种方法实现对稀疏矩阵 的转置与存储-Through a triple and rapid transposed two methods of sparse matrix The transpose and storage
MLP_iris
- Iris flower classification using MLP