代码搜索：Algorithm
找到约 10,000 项符合「Algorithm」的源代码
代码结果 10,000
www.eeworm.com/read/485329/6558753
java controlpanel.java
/* ControlPanel class */
import java.awt.*;
import java.applet.*;
import java.io.*;
import java.net.*;
import java.util.*;
/**
* This class extends the java.awt.Panel class to form
*
www.eeworm.com/read/483625/6599794
h daub.h
#include
/**
Daubechies D4 wavelet transform (D4 denotes four coefficients)
I have to confess up front that the comment here does not even come
close to describing
www.eeworm.com/read/481966/6633826
cpp 1094.cpp
/* This Code is Submitted by wywcgs for Problem 1094 on 2005-12-19 at 15:15:24 */
#include
#include
using namespace std;
int main()
{
int n[6];
int i;
while(true
www.eeworm.com/read/481966/6634183
cpp 2373.cpp
/* This Code is Submitted by wywcgs for Problem 2373 on 2006-09-25 at 19:31:10 */
#include
#include
using namespace std;
int C(int, int);
int main()
{
int n, m;
w
www.eeworm.com/read/479763/6678367
m contents.m
% Higher-Order Spectral Analysis Toolbox.
% Version 2.0.3 (R12 compliant) 27 Dec 2000
%
% New Features.
% Readme - Important release information about the HOSA Toolbox
%
www.eeworm.com/read/476885/6753833
m codice_au.m
%
% In order to obtain the source code for Fingerprint Recognition System Release 5.1
% ( you are using this last release ) please visit my webpage
% http://utenti.lycos.it/matlab/fingerprint4.htm
www.eeworm.com/read/410924/11264916
m contents.m
% HMM's
% HMM_Backward - HMM backward algorithm
% HMM_Boltzmann - Find the transition matrices of an HMM using Boltzmann networks
% HMM_Decoding - Find probable states fro
www.eeworm.com/read/264647/11307650
doc update.doc
Changes to version 1.0:
The algorithm used to calculate the initial CRC matrix has been
optimized to run in logarithmic time instead of linear time, the practical
upshot of which is tha
www.eeworm.com/read/263879/11338064
m linprog.m
function [x,fval,exitflag,output,lambda]=linprog(f,A,B,Aeq,Beq,lb,ub,x0,options)
%x=linprog(f, A, b)求解线性规划
% min z = f'x, Ax ≤ b；
%x=linprog(f, A, b, Aeq, beq)求解线性规划：
% min
www.eeworm.com/read/407557/11415947
java sortstringtest.java
package sample;
class SortStringTest {
static String arr[] = {
"this", "is", "the", "test", "for", "sort", "a", "string",
"by", "using", "the", "bubble", "sorting", "algorithm"
};