代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/117567/6101440
java compressor.java
package ranab.jar;
import java.io.*;
import ranab.util.*;
/**
* This is tha abstract base class of all the file compressors.
*
* @author Rana Bhattachary
www.eeworm.com/read/363584/6338484
inf avrcdc.inf
; Windows USB CDC Setup File
; Copyright (c) 2000 Microsoft Corporation
; Copyright (c) 2006 Recursion Co., Ltd.
[Version]
Signature="$Windows NT$"
Class=Ports
ClassGuid={4D36E978-E325-11C
www.eeworm.com/read/483253/6601932
m ilpc.m
function [a,rx] = ilpc(x,p)
E = zeros(p+1,1); % Energy vector
alpha=zeros(p,p);
R = autoc(x,p); % compute the autocorrelation sequence R(i)
rx=R;
E(1)=R(1); % energy of s
www.eeworm.com/read/483253/6602096
m ilpc.m
function [a,rx] = ilpc(x,p)
E = zeros(p+1,1); % Energy vector
alpha=zeros(p,p);
R = autoc(x,p); % compute the autocorrelation sequence R(i)
rx=R;
E(1)=R(1); % energy of s
www.eeworm.com/read/479064/6698781
h nameser_compat.h
/* Copyright (c) 1983, 1989
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are perm
www.eeworm.com/read/477716/6732798
c fig1_3.c
#include
/* START: fig1_3.txt */
int
Bad( unsigned int N )
{
/* 1*/ if( N == 0 )
/* 2*/ return 0;
else
/* 3*/ return Bad( N / 3 +
www.eeworm.com/read/410432/11287525
c factor.c
// factor.c -- uses loops and recursion to calculate factorials
#include
long fact(int n);
long rfact(int n);
int main(void)
{
int num;
printf("This program calculates facto
www.eeworm.com/read/404076/11492008
c fig1_3.c
#include
/* START: fig1_3.txt */
int
Bad( unsigned int N )
{
/* 1*/ if( N == 0 )
/* 2*/ return 0;
else
/* 3*/ return Bad( N / 3 +