代码搜索：recursion
找到约 958 项符合「recursion」的源代码
代码结果 958
www.eeworm.com/read/473080/6855065
c sw-uart.c
/* Name: sw-uart.c
* Project: AVR USB driver for CDC interface on Low-Speed USB
* Author: Osamu Tamura
* Creation Date: 2006-06-22
* Tabsize: 4
* Copyright: (c) 2006 by Recursion Co., Ltd.
* Lic
www.eeworm.com/read/192840/8269922
c sw-uart.c
/* Name: sw-uart.c
* Project: AVR USB driver for CDC interface on Low-Speed USB
* Author: Osamu Tamura
* Creation Date: 2006-06-22
* Tabsize: 4
* Copyright: (c) 2006 by Recursion Co., Ltd.
* Lic
www.eeworm.com/read/413998/11133952
c sw-uart.c
/* Name: sw-uart.c
* Project: AVR USB driver for CDC interface on Low-Speed USB
* Author: Osamu Tamura
* Creation Date: 2006-06-22
* Tabsize: 4
* Copyright: (c) 2006 by Recursion Co., Ltd.
* Lic
www.eeworm.com/read/413289/11160446
inf edn_usb_board_usb2uart_driver.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/151948/12158779
cpp knight_moves.cpp
/*
Author: BlueBlood--六院一队吴诚堃是也，其学号：200306020093
Explantion: Perhaps many people like to use recursion mathod, but as I have been practise using Dynamic Programming,
I did it in my own DP
www.eeworm.com/read/219325/14887917
h morse.h
;
; morse.h
;
;
; Macro to convert ascii strings and numbers to encoded morse code data.
; Uses macro recursion.
;
morsedata macro ; opcode,arg1,arg2,...
if isstr(\2)
morse_string \1,\2,0
else
www.eeworm.com/read/233448/4685518
c tailrecursion-1.c
/* { dg-do compile } */
/* { dg-options "-O1 -fdump-tree-tailr-details" } */
int
t(int a)
{
if (a)
return t(a-1);
else
return 0;
}
/* { dg-final { scan-tree-dump-times "Eliminated tail recursion
www.eeworm.com/read/272894/10936887
dpr ex.dpr
{
Method: Euler Path
Must use Stack.
Using recursion, will got MLE.
有向图路径不可逆, got WA 5 times.
}
program Ural_1176(Input,Output);
const
MaxN=1000;
MaxLen=32000;
type
TIndex=Longint;
www.eeworm.com/read/458661/7291872
m frwrec.m
% frwrec.m - order-increasing forward layer recursion - from r to A,B
%
% Usage: [A,B] = frwrec(r)
%
% r = reflection coefficients = [r(1),...,r(M+1)], M = number of layers
% A,B = (M+1)x(M+1) ma
www.eeworm.com/read/315751/13536834
m frwrec.m
% frwrec.m - order-increasing forward layer recursion - from r to A,B
%
% Usage: [A,B] = frwrec(r)
%
% r = reflection coefficients = [r(1),...,r(M+1)], M = number of layers
% A,B = (M+1)x(M+1) ma