代码搜索:伏安法
找到约 10,000 项符合「伏安法」的源代码
代码结果 10,000
www.eeworm.com/read/320260/13429728
cpp 追赶法.cpp
//追赶法C语言源程序
///////////////////////////
//微分方程为
//du/dx=u-2x/u;
//u(0)=1
///////////////////////////
//#include "stdafx.h"
#include
#include
#include
#i
www.eeworm.com/read/315835/13535518
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/311535/13629649
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/308157/13707172
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/302798/13827207
doc 投影法.doc
www.eeworm.com/read/151133/5685966
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/487037/6522707
txt 气泡法.txt
inline void swap(int& x, int& y)
{
int t=x;
x = y;
y = t;
}
void sort(int* a, int n)
{
bool swapped;
do{
swapped = false;
www.eeworm.com/read/483137/6610845
txt 追赶法.txt
#include//追赶法
double *Catch(double *a,double *b,double *c,double *f);
int n;
void main()
{
cout
www.eeworm.com/read/481555/6643161
m 查询法.m
g=serial('com2');
g.baudrate=115200;
g.parity='none';
g.stopbits=1;
g.inputbuffersize=256;
gTerminator='LF';
recbuf=zeros(1,40);
framelen=23;%数据帧长度(每帧23ByTe)
framenum=0;%清接收帧
rectr
www.eeworm.com/read/481562/6643273
m 查询法.m
g=serial('com2');
g.baudrate=115200;
g.parity='none';
g.stopbits=1;
g.inputbuffersize=256;
gTerminator='LF';
recbuf=zeros(1,40);
framelen=23;%数据帧长度(每帧23ByTe)
framenum=0;%清接收帧
rectr