Algorithm List Page 1345

Algorithm list

Sort by ：

« 1 2 ... .40 .41 .42 .43 .44 1345.46 .47 .48 .49 .50 ... 3400 »

rabin_karp Downloaded：0: An implementation of the Rabin Karp Algorithm to find the longest common sub-sequence between to strings in C.
Update : 2024-10-15 Size : 6kb Publisher : NS_Noob
LUforAX=b Downloaded：0: LU decomposition of matrix to calculate the linear equations, matrix decomposition when the use of which is Doolittle decomposition.
Update : 2024-10-15 Size : 1kb Publisher : 岳晓鹏
crout Downloaded：0: Matrix crout decomposition, the matrix into a lower triangular matrix and upper triangular matrices, in which the upper triangular matrix is the upper triangular matrix.
Update : 2024-10-15 Size : 1kb Publisher : 岳晓鹏
gauss Downloaded：0: Gaussian elimination method for solving AX = b, using the augmented matrix for the elementary row transformation, the coefficient matrix into an upper triangular matrix, and then back to the tape, you can get the solutio
Update : 2024-10-15 Size : 1kb Publisher : 岳晓鹏
jacobi Downloaded：0: For equations AX = b, when the coefficient matrix is nonsingular, rewriting the original equation, using the formula X ^ k = BX ^ (k+1)+g for iterative solution.
Update : 2024-10-15 Size : 1kb Publisher : 岳晓鹏
gs Downloaded：0: Gauss- Seidel iteration method, the Jacobi iteration is different from the latest results of each iteration, the process used in the current iteration.
Update : 2024-10-15 Size : 1kb Publisher : 岳晓鹏
Gmin Downloaded：0: Compiled using the Fortran language filled function method for solving the global optimal solution
Update : 2024-10-15 Size : 2kb Publisher : dennis
jisuanjihe Downloaded：0: Computational Geometry Algorithm Analysis and Design
Update : 2024-10-15 Size : 7.44mb Publisher : jsh
chengxusheji Downloaded：0: Programming Guide
Update : 2024-10-15 Size : 233kb Publisher : jsh
myEuclid Downloaded：0: compute the greatest common divisor of two integers
Update : 2024-10-15 Size : 1kb Publisher : andy
MyShuffleTest Downloaded：0: Suppose we start with N=3 and run the shuffling test four times, resulting in the arrays: [2, 0, 1] [2, 1, 0] [2, 0, 1 ] (This not very likely, but i s possible) Then the resulting count array would be: 0: 0 3 1 1: 0 1 3
Update : 2024-10-15 Size : 1kb Publisher : andy
MyFibonacci Downloaded：0: The idea is that as Fibonnaci values are computed you store them in the array A. So when another F(n) is to be computed either A[n] is still 0 or else A[n] is already equal to F(n). If A[n] is 0, you have to make the usu
Update : 2024-10-15 Size : 10kb Publisher : andy

« 1 2 ... .40 .41 .42 .43 .44 1345.46 .47 .48 .49 .50 ... 3400 »

Search in result