资源列表
getRankN.m
- fingerprint get rank
pca
- 基于主元分析的异常检测和故障诊断，用于对具有高度线性相关的测量数据进行分析和处理，其最终实现高维空间降维的目的。-Anomaly detection based on principal component analysis and fault diagnosis, used for highly linear correlation measurement data analysis and processing, its ultimate achieve the goal of higher
bellFord-(2)
- BellFord 算法，查找图的最短路径，C++代码实现-BellFord algorithm, find out the shortest path of figure and c++ code implementation
MSP_Num
- 求网络的最小生成树的个数，C++源码实现-Calculate the minimum spanning tree number of the network , c++ source code to achieve
Data-structures
- 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。-The book is on the computer science and engineering fields, one of the basic research subjects- data structure and algorithm monographs
erchashu
- c语言实现二叉树的非递归排序，vc编译已通过，适合新手学习-C language implementation of the two fork tree of non recursive sort, VC compiler has passed, suitable for beginners to learn
SortAlgorithm
- 8中排序算法的C实现(冒泡、插入、选择、堆排序、归并排序、快速排序、基数排序)-8 sorting algorithm implemented by C
HW2
- This program is to give you practice in the use of UNIX functions fork() and pipe() and to implement message communication between processes. In this program you will implement a simple UNIX shell in C. The shell reads a command line from the input,
Punycode
- 易语言编写的Punycode编解码模块，用于对中文或其他使用Unicode编码的语言转换成为DNS系统的编码-E-language Punycode codec module for Chinese or other languages that use Unicode encoding is converted into coded DNS system
reconstrucbtree
- 北京大学数据结构课后作业 由中根序列和后根序列建立二叉树-Homework Central Peking data structure root root sequence after sequence and the establishment of binary tree
MKTHNUM-
- Spoj MKTHNUM题解 可持久化函数式编程线段树解法 文件内有相对详细的解法思路和数据结构构造方法-A solution to Spoj MKTHNUM.Which used persistent functional segment tree. Detailed information is written in the file.
Binary-Inddexed-Tree
- 一个树状数组各种改造姿势的模板。除了常规用法单点查询求前缀和外，支持区间修改单点查询、区间修改区间求和、RMQ、离线平衡树以及多维扩展-Many improved versions of binary indexed tree. Which can be used to do these kinds of work in a 1D array: Change one point+k and get the prefixsum Change a range+k and get value