代码搜索：移相法

找到约 10,000 项符合「移相法」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/378042/9252892

lst 冒泡法.lst

冒泡法.asm Assembled with CASMW 2007-11-5 9:10:47 PAGE 1 0000 1 address1 EQU $40 0000 2 address2 EQU $42 0000 3 n1 EQU $
·
www.eeworm.com/read/378042/9252894

err 冒泡法.err

CASM08 - Command line ASseMbler - Version 3.11 - SLD P&E Microcomputer Systems, Inc. Successful assembly - No errors. Total lines assembled : 55
·
www.eeworm.com/read/378042/9252904

asm 冒泡法.asm

address1 EQU $40 address2 EQU $42 n1 EQU $44 temp equ $45 flag equ $46 org $0060 ORG $8000 Main: db 20,30,55,42,33,10,80,60,40,57,77,12,23,
·
www.eeworm.com/read/377037/9296998

c 追赶法.c

#include #define N 10 void main() { float a[N],b[N],c[N],f[N]; int i,n,j; printf("input n:"); scanf("%d",&n); printf("input a:\n"); for(i=2;i
·
www.eeworm.com/read/376627/9311811

c 排序法.c

#include #include struct node { int key; }r[20]; struct rnode { int key; int point; }; main() { void print(struct node a[20],int n); int creat(); void shell
·
www.eeworm.com/read/373853/9432305

doc 松弛法.doc

·
www.eeworm.com/read/363342/9958248

c 排序法.c

#include #include struct node { int key; }r[20]; struct rnode { int key; int point; }; main() { void print(struct node a[20],int n); int creat(); void shell
·
www.eeworm.com/read/165041/10078478

txt 分治法.txt

·
www.eeworm.com/read/359966/10113430

c 进退法.c

/*用于确定目标函数初始搜索区间，文件名jtf.c*/ /*输出变量：a:n维数组，搜索区间的下限*/ /* b:n维数组，搜索区间的下限*/ /*输入变量：x0:n维数组，搜索初始点*/ /* h0：初始步长*/ /* s:n维数组，搜索方向*/ /* n:优化模型维数*/ #include "funct.c" #include "stdio.h"
·
www.eeworm.com/read/359101/10165924

cpp 幂法.cpp

#include #include #define N 3 #define EPS 1e-6 #define KM 30 void PowerMethod(float *A) { float MaxValue(float *,int ); float U[N],V[N],r2,r1; float temp; int i,j,
·