资源列表
towround
- 实现运筹学中线性规划中二阶段法，初次上传，请多多指证，-Make tow around come true，I first laod on。 please help me
BL_XY
- 高斯正算，即大地坐标系转换成高斯独立坐标系-direct solution of the gauss projection
NumericalSolutionOfTheFalknerSkanEquationForVario
- this file solves falkner skan equation
beibaowenti
- 背包问题详细讲解,背包问题详细讲解一共九课-Elaborate knapsack problem, knapsack problem to explain in detail a total of nine courses
TimeComplexity
- 测试算法在不同规模下的时间复杂度，学会如何分析一个算法的时间复杂度；-Test algorithm under different time scale of complexity and learn how to analyze the time complexity of an algorithm
Strassen
- 设A 和 B 是两个n * n阶矩阵，求它们两的乘积矩阵C。这里，假设n是2的幂次方；-N*N matrix
commom_algorithm_assembly_using_C.tar
- C常用算法程序集-徐士良 C常用算法程序集-徐士良-commom algorithm assembly using C by Xu ShiLiang
ComplexSample
- 通过例子实现复数乘法、除法、模、根、实幂指数、复幂指数、自然对数、正弦、余弦、正切的运算。-Multiplication,division,modulus，root，real exponent，complex exponential，natural logarithm，sine，and cosine of a complex number in a example.
M-mary
- 通过M-ary乘方原理和二进制算法原理实现模指数运算-By a power of M-ary principle and principle of achieving the binary modular exponentiation algorithm
Greatest_common_factor
- 我使用數學中輾轉相除法來求"最大公因數" 有需要的同好可以下載使用-I use math in the Euclidean algorithm to achieve " the greatest common divisor" in need of enthusiasts can download ^ ^
josephous
- Josephous问题答案，Josephous问题：m个小孩围成一个圈，从第一个小孩顺时针方向每数到第n个小孩就离开，最后的小孩是胜利者，求第几个小孩是胜利者。-Josephous answer, Josephous problem: m a child in a circle, clockwise from the first child to n every few months to leave children, the last child is a winner, find the
PFF
- 可计算包括节点力，一般非节点力，支座沉降、温度荷载作用、制造误差的平面桁架、梁、刚架及其组合结构的节点位移与杆端力；可同时计算多种工况下的节点位移与杆端力。 -Calculated including the nodal forces, the general non-node, bearing sedimentation, temperature loads, manufacturing errors of the plane truss, beam, frame and composit