资源列表
skip_list
- 跳跃表的C语言实现，此算法用于rt-thread。-Skip list implemented with C. It is used in rt-thread.
Introduction-to-Algorithms
- 算法导论的英文版，讲解算法的非常经典的书。-English version of Introduction to Algorithm. A classical book to teach algorithm.
jiaogucaixiang
- 计算给定的正整数n 对应的角谷序列，并求出其中第k大的数。n 和k 都通过标准输入输出得到。-Computing a given positive integer n corresponding Kakutani sequences and determine where the first large numbers k. n and k are obtained through standard input and output.
xishujuzhen
- 用十字链表实现稀疏矩阵的存储和各种运算。-Cross-linked with a variety of computing for storage and sparse matrix.
shu
- 增强二叉搜索树是二叉搜索树的一种推广，其中每个结点除了保存关键字外，还保存了以该结点为根的子树的结点数目（包括该结点本身）。实现其建立、复制、前/中/后序遍历、层高统计、结构从属判断等操作。-Enhanced binary search tree is a generalization of a binary search tree, where each node except to save the keyword, but also save the node number points
jixian
- 在进行高精度的数值运算时，常常受到数据处理长度的制约，当 数值位数太大时就会超出计算机的处理能力。要解决这个问题,从数据结构方面来考虑，分别采用适当的算法来接收、存储、输入、输出以及进行高精度的运算。-During high-precision numerical computation, data processing often restricted length, when the value is too large digits will exceed the processing
muskSuccess
- 数据挖掘与机器学习中可以用于多示例学习的原始数据集MUSK1 已经转化成ARFF格式可直接用于weka的-Data mining and machine learning the original data set can be used for multi-instance learning MUSK1 has been transformed into ARFF format it can be used directly in weka
MUSK2success
- Data mining and machine learning the original data set can be used for multi-instance learning MUSK2 has been transformed into ARFF format it can be used directly in weka-Data mining and machine learning the original data set can be used for multi-in
Power-electronic-EMT-simulation
- 电力电子电磁暂态仿真电力电子电磁暂态仿真-power electronic EMT simulationpower electronic EMT simulation
N-Queue_DFS
- BFS法求解N皇后问题，输出全部解决方案。-BFS method for solving N queens problem and output all solutions.
ChessTest
- 在一个N*N的棋盘上指定起点坐标及终点坐标，以马走日的方式输出从起点到终点的一条可能路径。并用图形演示其跳马路径。-Given a start piont p1 and a end point p2 on the N*N chessboard, find a possible path p1 to p2(No duplicate) and show it in the way of partten.
knight-tour_DFSandBFS_SQueue
- 在一个N*N的棋盘上指点任意一点的坐标，以马走日的方式走完整个棋盘且没有重复，试分别用DFS、BFS方法求解并输出全部可能的路径。-knight tour problem solved by the method of BFS and DFS.