代码搜索：recursive
找到约 2,177 项符合「recursive」的源代码
代码结果 2,177
www.eeworm.com/read/359019/10169549
c format.c
/* @(#)format.c 1.29 98/03/31 Copyright 1985 J. Schilling */
/*
* format
* common code for printf fprintf & sprintf
*
* allows recursive printf with "%r", used in:
* error, comerr, comerrno, errm
www.eeworm.com/read/356808/10221191
m rivtr.m
function [arvec, fpe, wt] = rivtr(y,morder,arorder, lambda, delta, nsmuth)
%RIVTR Recursive instrumental algorithm using the transversal structure.
% [arvec, fpe, wt] = rivtr(y,morder,arorder,lambd
www.eeworm.com/read/356808/10221205
m rivtr.m
function [arvec, fpe, wt] = rivtr(y,morder,arorder, lambda, delta, nsmuth)
%RIVTR Recursive instrumental algorithm using the transversal structure.
% [arvec, fpe, wt] = rivtr(y,morder,arorder,lambd
www.eeworm.com/read/425862/10313207
cpp lslfilter.cpp
/* lslfilter.c++ recursive Least-Squares Lattice (LSL) scalar case
for exponentially weighted data
See Algorithm 5.3 of Cowan & Grant, Adaptive Filters
p 115
*/
static const char rcsid
www.eeworm.com/read/279234/10453749
pl fig06_13.pl
#!/usr/bin/perl
# Fig 6.13: fig06_13.pl
# Recursive factorial subroutine
# call function factorial for each of the numbers from
# 0 through 10 and display the results
foreach ( 0 .. 10 ) {
www.eeworm.com/read/352442/10552458
m rivtr.m
function [arvec, fpe, wt] = rivtr(y,morder,arorder, lambda, delta, nsmuth)
%RIVTR Recursive instrumental algorithm using the transversal structure.
% [arvec, fpe, wt] = rivtr(y,morder,arorder,lambd
www.eeworm.com/read/159920/10588716
c ll_msort.c
/*
** Here's an example of how to sort a singly-linked list. I think it
** can be modified to sort a doubly-linked list, but it would get a bit
** more complicated. Note that this is a recursive
www.eeworm.com/read/349622/10813721
m rivtr.m
function [arvec, fpe, wt] = rivtr(y,morder,arorder, lambda, delta, nsmuth)
%RIVTR Recursive instrumental algorithm using the transversal structure.
% [arvec, fpe, wt] = rivtr(y,morder,arorder,lambd
www.eeworm.com/read/272848/10941079
cpp rsum.cpp
// recursive sum of n numbers
#include
#include // has copy
using namespace std;
template
T rSum(T a[], int n)
{// Return sum of numbers a[0:n - 1].
if (
www.eeworm.com/read/272848/10941208
cpp rsumcount.cpp
// step count for recursive sum of n numbers
#include
#include
using namespace std;
int stepCount = 0;
template
T rSum(T a[], int n)
{// Return sum of nu