资源列表
xppaut_latest.tar
- XPPOUT latest, Window GUI
HuffmanCode
- 使用散列和哈弗曼编码完成任意文本数据文件的加密和压缩,压缩率在50 以上-Huffman coding is completed using a hashing and encryption and compression of any text data file compression rate of 50 or more
matrix
- 有一个3*4的矩阵，要求输出其中的最大的那个元素的值，以及其所在的行号和列号-3*4 matrix, the output requirements of which the maximum value of the elements, and the row and column number
20150912
- 卡尔曼C语言算法,四轴滤波最佳处理算法那。-Kalman algorithm C language, four axis filtering processing algorithms that best.
example
- 用于点云数据的简化，选出最小包围方格中的重心以达到数据缩减-The minimum bounding box method, used to process point cloud data, solving the point cloud data in virtual grid in the center of gravity, can be used for data reduction
BookManagementSystem
- 学校图书馆管理系统，可以添加查询删除图书，并统计每本书近期的借阅信息，已经在本校图书管试运行效果良好，欢迎下载交流-School library management system, you can add query-remove books, and statistical information for each book borrowed recently, has been in the school library test tube running well, welcome to
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