代码搜索：移相法
找到约 10,000 项符合「移相法」的源代码
代码结果 10,000
www.eeworm.com/read/380446/9149266
cpp extremumfraction1d.cpp
//ExtremumFraction1D.cpp 一维极值连分式法
#include //模板类iostream输入输出流标准头文件
#include "Extremum.h" //极值头文件
void main(void)
{
valarray js(2);
valarray x(2);
long doub
www.eeworm.com/read/380114/9162198
txt jishufa1.txt
//基数排序法(类方法)jishufa1.cpp
#include
#include
const int N=10;
class jishu
{public:
jishu(int d[],int s):n(s)
{for(int i=0;i
www.eeworm.com/read/380114/9162253
cpp jishufa1.cpp
//基数排序法(类方法)jishufa1.cpp
#include
#include
const int N=10;
class jishu
{public:
jishu(int d[],int s):n(s)
{for(int i=0;i
www.eeworm.com/read/183298/9171101
cpp kuaisufa2.cpp
//快速排序法(类方法)kuaisufa2.cpp
#include
#include
#include
#include
#define N 10
class kuaisu
{public:
kuaisu(float a[],int m):n(m)
{for(int i=0;i
www.eeworm.com/read/183298/9171111
cpp xuanze3.cpp
//选择排序法(类方法)xuanze3.cpp
#include
#include
#include
#include
#define N 10
class xuanze
{public:
xuanze(int a[],int m):n(m)
{for(int i=0;i
www.eeworm.com/read/183298/9171183
cpp jishufa2.cpp
//基数排序法(函数模板)jishufa2.cpp
#include
#include
#include
#include
const int N=10;
const int rd=10;
const int D=2;
void output(int a[],int n)
{cout
www.eeworm.com/read/378764/9216702
txt u.txt
函数名: ultoa
功 能: 转换一个无符号长整型数为字符串
用 法: char *ultoa(unsigned long value, char *string, int radix);
程序例:
#include
#include
int main( void )
{
unsig
www.eeworm.com/read/378764/9216729
txt v.txt
V类
函数名: vfprintf
功 能: 送格式化输出到一流中
用 法: int vfprintf(FILE *stream, char *format, va_list param);
程序例:
#include
#include
#include
FILE *fp;
in
www.eeworm.com/read/378764/9216735
txt o.txt
函数名: open
功 能: 打开一个文件用于读或写
用 法: int open(char *pathname, int access[, int permiss]);
程序例:
#include
#include
#include
#include
int m
www.eeworm.com/read/378764/9216737
txt s.txt
函数名: sound
功 能: 以指定频率打开PC扬声器
用 法: void sound(unsigned frequency);
程序例:
/* Emits a 7-Hz tone for 10 seconds. Your PC may not be able to emit a 7-Hz tone.*/
#include
int mai