资源列表
一个可以对任意长整数进行加减的类
- 在Visual C++6.0 WinXp下编译通过采用类来实现,从CString继承而来数据运算的结果保存在CString类中理论上可对任意长的数据进行相加在Release目录下有可执行文件，将*.txt拖放到longadd.exe上即可，*.txt为数据文件-in Visual C Compiler 6.0 WinXp adopted under the category achieved redeem inherited from the Operational data stored in
最优二分检索树构造及绘制
- 这个程序可实现最优二分检索树的构造，绘制和检索，请在Turboc 2.0下运行-this procedure can achieve optimal two-tree structure retrieval, mapping and retrieval, please run Turbo 2.0
有穷自动机
- 自己编的一个判断浮点数的有限自动机，大家来看看啊-own series of the float of a judge finite automata, we arrives
32to10
- 此為簡單的32進制轉換技巧,善加瞭解後知道要點後,即可製做出不同的進制計算需求.-this as a simple base for the conversion of 32 skills, properly understood know points, the system can make a different band computing needs.
牛顿迭代法求根
- 牛顿迭代法求根 这个也是计算方法中的常用计算程序 学过的人都知道的-Newton iterative method for solving this calculation method is commonly used in the calculation procedures learned in the people know that the
雅可比迭代解线性方程组
- 雅可比迭代解线性方程组 这个也是计算方法中另一种 求解线性方程组的计算程序-Jacobi iterative solution of linear equations This is a separate calculation method for solving linear equations of computational procedures
primenumber.
- 一个求素数个数的程序 算pi(1000000000)不要1秒每个块如果10 0000, 需要 < 100000次全搜索加上8000 * 8000 < 6400 0000 总的次数小于7000 0000,就是说,搜索次数大大降低-for a few number-counting procedures pi (1000000000) not a second of each block of 10 0000, the need lt; Search 100,000 plenary wi
LBC
- (31,21) bch 码编解码程序 C++实现.-(31,21) BCH encoding and decoding procedures C achieve.
exlp
- 一个小型计算器，可以进行/加/减/乘/除/开放运算，希望你们喜欢。-a small calculator, can / add / subtract / multiply / addition / open computing, I hope you like.
brookgpu-0.4.tar
- 用于GPU通用计算的编程语言BrookGPU 0.4-GPU generic terms for the programming language BrookGPU 0.4
牛顿下山
- 这个可以很清楚的计算一些复杂的问题,很好的一中算法-this can be clearly calculated to some complicated problems, a good algorithm
三元组
- C语言数据结构作业三元组序列表，特点是非零元在表中按行序有序储存，因此便于进行依行顺序处理的矩阵运算，然而若需按行号存取某一行的非零元，则需从头开始进行查找-C language data structures operating sequence in Table 3, which is characterized by non-zero yuan in the table in an orderly sequence by storage firms, according to facili