资源列表
Liangyoudunsuanfa
- 梁友栋-Barskey裁剪算法,在裁剪算法中比较快的一种算法,-friends of Liang Dong-Barskey cutting algorithm, the algorithm cutting a faster algorithm,
playOnwords
- 这是一个关于字符串的问题,虽然小但是很精致.-This is a string of problems, although small but very delicate.
luxingjia
- 旅行家问题,关于旅行家问题的一小段代码。值得大家学习和参考-travelers, travel home on a small portion of the code. Worth learning and reference
1354520
- 定义一个Shape抽象类，在此基础上派生出Rectangle和circle类，二者都有GetArea（）函数计算对象面积，GetPerim（）函数计算对象的周长。使用Rectangle类派生出一个新类Squre。
lallala
- 关于最佳贪婪算法的实现 关于最佳贪婪算法的实现
STAT_KOLMOGOROV_TEST.rar
- This function performs the one sample, two tailed Kolmogorov-Smirnov hypothesis test on a set of data samples for a given cumulative distribution function.,This function performs the one sample, two tailed Kolmogorov-Smirnov hypothesis test on a se
01package
- 01背包算法 解决算法 与众大侠一起参考 交流 -01 knapsack algorithm to solve algorithm and the public with reference to the exchange of heroes
BST-Binary-search-tree
- This BST algorithm,Binary Search Tr-This is BST algorithm,Binary Search Tree
Expressions
- 表达式cpp实现 数据结构实验源代码 实现前序、中序、后序表达式-Expression codes Formerorder expressions regular expression&Postorder expressions
The-most-architectural-sequence
- Java实现最大子序列问题，算法导论实验三-Java implementation of the maximum subsequence problem, algorithms, Introduction to Experimental
LINBAIR
- linbair( )用林士谔——Bairstow方法求实系数多项式的根。-linbair () with the Rumsey NGOK- Bairstow method and realistic coefficient roots of a polynomial.
getPrimeNumber
- 非常快的求质数算法，百万数据在毫秒之间。以牺牲空间换取时间代价。-Very fast primes seeking algorithms, millions of data in milliseconds. At the expense of space for time costs.