代码搜索：移相法
找到约 10,000 项符合「移相法」的源代码
代码结果 10,000
www.eeworm.com/read/228702/14365821
asm a4-4.asm
;A4-4.asm
;用减奇法开平方运算
STACK1 SEGMENT STACK
DW 256 DUP(?)
STACK1 ENDS
DDATA SEGMENT
MES1 DB 'The square root of $'
MES2 DB ' is:$'
NUMB DW 0040H
DDATA ENDS
CODE SEGMENT
www.eeworm.com/read/226577/14457473
m hjjsort.m
function B=hjjsort(A)
% 将A=[3 1 4 7 6 9]置换成【7 9 6 3 4 1】
N=length(A);t=[0 0];
for i=1:N
temp(i,2)=A(i);
temp(i,1)=i;
end
for i=1:N-1 % 沉底法将 A 排序
f
www.eeworm.com/read/225059/14556566
h calculate.h
#include "math.h"
//用混合同余法产生（a，b）区间上的随机数yi.
double uniform(double a,double b,long *seed)
{
double t;
*seed=2045*(*seed)+1;
*seed=*seed-(*seed/1048576)*1048576;
t=(*seed)/1048576.0;
t=a+(b
www.eeworm.com/read/224419/14594181
h calculate.h
#include "math.h"
//用混合同余法产生（a，b）区间上的随机数yi.
double uniform(double a,double b,long *seed)
{
double t;
*seed=2045*(*seed)+1;
*seed=*seed-(*seed/1048576)*1048576;
t=(*seed)/1048576.0;
t=a+(b
www.eeworm.com/read/223339/14644637
cpp algo0702.cpp
Status CreateUDN(MGraph &G) {// 算法 7.2
// 采用数组（邻接矩阵）表示法，构造无向网G。
int i,j,k,w;
VertexType v1,v2;
printf("G.vexnum :" ); scanf("%d",&G.vexnum);
printf("G.arcnum :"); scanf("%d",&G.a
www.eeworm.com/read/221812/14719656
h insertsort.h
void InsertSort (DataType a[], int n)
//用直接插入法对a[0]--a[n-1]排序
{
int i, j;
DataType temp;
for(i=0; i -1 && temp.key
www.eeworm.com/read/221324/14744429
txt c语言库函数(u类字母).txt
函数名: ultoa
功 能: 转换一个无符号长整型数为字符串
用 法: char *ultoa(unsigned long value, char *string, int radix);
程序例:
#include
#include
int main( void )
{
unsigned
www.eeworm.com/read/221324/14744432
txt c语言库函数(o类字母).txt
函数名: open
功 能: 打开一个文件用于读或写
用 法: int open(char *pathname, int access[, int permiss]);
程序例:
#include
#include
#include
#include
int main
www.eeworm.com/read/121616/14747128
txt [c函数之g].txt
函数名: gcvt
功 能: 把浮点数转换成字符串
用 法: char *gcvt(double value, int ndigit, char *buf);
程序例:
#include
#include
int main(void)
{
char str[25];
double num;
int sig