资源列表
Design
- 设计算法判断一个算术表达式的圆括号是否配对-Design algorithm to determine an arithmetic expression is paired parentheses
search
- 在从大到小的有序表上进行顺序查找，监视哨设在高下标端,分析：本算法查找成功情况下的平均查找长度为L.length/2，不成功情况下为L.length。-Find the line from the big to small,the point set at the high way
Hanoi
- 有三根柱子A，B，C，A柱子上有N个盘子，从小到大依次叠放，要求把A上的盘子都移到C上，B可以作为临时存放，移动的时候必须始终遵循小盘子在大盘子上面，且每次只能移动一个盘子。-There are three pillars A, B, C, A with their N dishes, from small stacked in turn requires the plates are A move to C, B can be used as A temporary storage, move
c-zuoyeti
- 编写程序计算的值，水仙花，百鸡问题，起泡法等，C语言作业题。-Write a program calculation values
VC6xianduanjiaocha
- 基于VC6.0实现线段交叉检测，界面友好-VC6.0 to achieve line-crossing detection, friendly interface
circle
- 计算园 外接圆 内接圆周长体积，长度等所有参量 属于基础教程-Internal calculation Park circumcircle circumference size, length, etc. All parameters belong to the Essentials
java2
- java编程使用抽象类或借口计算三种几何图形的面积与周长，几何图形的尺寸自定-java programming using the abstract class or an excuse to calculate area and perimeter of the three geometry, the geometry of size custom
1-(a-b)
- 此程序为利用广义欧几里德算法求解最大公约数GCD-This procedure for the use of the generalized Euclidean algorithm for solving the greatest common divisor GCD
2-mochongfu
- 通过C语言实现对于b^n (mod m)形式的式子的模重复平方法计算-C language formula for b ^ n (mod m) in the form of mold repeat method basis
3-prime-check
- 利用模重复平方实现费马特素性检验，范围在四万之内就行。-Model repeated square Fei Mate primality test, the range of forty thousand of the line.
4-prime-generation
- 利用费马特素性检验实现40000以内的所有素数的生成并通过文件输出-Fei Mate primality test 40000 or less of all prime numbers generated by the file output
3-prime-check2
- 利用模重复平方实现费马特素性检验，范围在四万之内，纠正了一些小数值的错误。-Model repeated square Fei Mate primality test, the range of forty thousand of the corrected some small numerical errors.