代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/142433/12945876
cpp legndr.cpp
#include "NumMeth.h"
void legndr( int n, double x, Matrix& p) {
// Legendre polynomials function
// Inputs
// n Highest order polynomial returned
// x Value at which polynomial is eva
www.eeworm.com/read/310212/13654596
m levinson.m
function a=levinson(R,N);
%LEVINSON Levinson-Durbin Recursion.
% A = LEVINSON(R,N) solves the Yule-Walker system of equations
% using the Levinson-Durbin recursion. R is a vector of
% aut
www.eeworm.com/read/482107/6627368
js bbcode.js
/*
[Discuz!] (C)2001-2009 Comsenz Inc.
This is NOT a freeware, use is subject to license terms
$RCSfile: bbcode.js,v $
$Revision: 1.55 $
$Date: 2007/07/30 05:17:52 $
*/
var re;
if(isU
www.eeworm.com/read/481428/6640995
html functions.html
Functions
Functions are the most powerful building blocks.
www.eeworm.com/read/403756/11510971
js bbcode.js
/*
[Discuz!] (C)2001-2007 Comsenz Inc.
This is NOT a freeware, use is subject to license terms
$RCSfile: bbcode.js,v $
$Revision: 1.55 $
$Date: 2007/07/30 05:17:52 $
*/
var is_mac = us
www.eeworm.com/read/400152/11582099
cpp binarytree.cpp
//***************************//
#include
#include "BinaryTree.h"
void main() {
//建一棵树(如图5.5所示)
BinaryTree a, b, c, d, e, f, g, h, i,nulltree;
d.CreateTree('D', nulltree,
www.eeworm.com/read/261074/11667538
m legndr.m
function p = legndr(n,x)
% Legendre polynomials function
% Inputs
% n = Highest order polynomial returned
% x = Value at which polynomial is evaluated
% Output
% p = Vector containing
www.eeworm.com/read/261064/11667855
f legndr.f
subroutine legndr( n, x, p)
integer*4 n
real*8 x, p(*)
! Legendre polynomials function
! Inputs
! n Highest order polynomial returned
! x Value at which polynomial
www.eeworm.com/read/154209/11982982
m levinson.m
function a=levinson(R,N);
%LEVINSON Levinson-Durbin Recursion.
% A = LEVINSON(R,N) solves the Yule-Walker system of equations
% using the Levinson-Durbin recursion. R is a vector of
% aut