代码搜索：移相法
找到约 10,000 项符合「移相法」的源代码
代码结果 10,000
www.eeworm.com/read/367107/9782431
cpp le_symmetryregulareuationsquareroot.cpp
//LE_SymmetryRegularEuationSquareRoot.cpp
//求解对称正定方程组的平方根法
#include //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
double a[4][4] =
{
{5.0, 7.
www.eeworm.com/read/367107/9782433
cpp le_totalchoicegaussjordan.cpp
//LE_TotalChoiceGaussJordan.cpp 全选主元高斯-约当消去法
#include //输入输出流头文件
#include "LinearEquation.h" //线性方程(组)求解头文件
void main()
{
int i;
double a[4][4] = //实系数矩阵
{
{1.0,
www.eeworm.com/read/269229/11104519
cpp maopao4.cpp
//通用冒泡排序法(上浮)maopao4.cpp
#include
#include
#include
#include
#define N 10
typedef int (*isgreat)(void *this_num,void *next_num);
void gensort(void *base
www.eeworm.com/read/269229/11104584
cpp maopao1.cpp
//通用冒泡排序法(下沉)maopao1.cpp
#include
#include
#include
#include
#define N 10
typedef int(*isgreat)(void *this_num,void *next_num);
void gensort(void *base,
www.eeworm.com/read/269229/11104608
cpp kuaisufa3.cpp
//快速排序法kuaisufa3.cpp
#include
#include
#include
#include
#define N 10
float b[N];
void output()
{for(int i=0;i
www.eeworm.com/read/269229/11105189
cpp fibonaci.cpp
//Fibonacci查找法Fibonaci.cpp
#include
typedef int KeyType;
typedef struct RecType
{KeyType key;}RecType;
int fib(int n)
{int i,f,f0=0,f1=1;
if(n==0) return 0;
if(n==1) return 1;
www.eeworm.com/read/414272/11122655
m q3_3.m
function Q3_3
[N M G]=data2;
K=data1;
%插值法
[m n]=size(M);
for k=1:m
if(sum(M(k,:))==0)
continue;
end
line=1;
x=1;
y=1;
for j=1:n
if(M(k,j))
www.eeworm.com/read/414272/11122668
asv q3_3.asv
function Q3_3
[N M G]=data2;
K=data1;
%插值法
[m n]=size(M);
for k=1:m
if(sum(M(k,:))==0)
continue;
end
line=1;
x=1;
y=1;
for j=1:n
if(M(k,j))
www.eeworm.com/read/268481/11136819
h 10_1.h
#ifndef ARRAY_BASED_SORTING_FUNCTIONS
#define ARRAY_BASED_SORTING_FUNCTIONS
//用直接插入排序法对数组A中的元素进行升序排列
template
void InsertionSort(T A[], int n)
{
int i, j;
T temp;
// 将