代码搜索：移相法
找到约 10,000 项符合「移相法」的源代码
代码结果 10,000
www.eeworm.com/read/395240/8188261
cpp 幂法.cpp
#include "stdio.h"
#include "malloc.h"
#include "math.h"
#define Aij A[i*n+j]
double *chushiA(int n)
{int i,j;
double *A;
A=(double *)malloc((n*n)*sizeof(double));
printf("请输入矩阵:\
www.eeworm.com/read/293680/8280004
sln 起泡法.sln
Microsoft Visual Studio Solution File, Format Version 8.00
Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "起泡法", "起泡法.vcproj", "{E45AD7C6-84F1-4143-9688-411CFF3CBC5E}"
ProjectSection(ProjectDe
www.eeworm.com/read/293680/8280017
cpp 起泡法.cpp
// 起泡法.cpp : 定义控制台应用程序的入口点。
//
//本文对排序中最常见的起泡法进行分析，发现在实现单向起泡的同时可以实现双向起泡，从而实现了冒泡算法的改进，提高了运算速度。
// 关键字：程序设计、起泡、双向起泡、VC++
//排序是在程序设计中常碰到的问题，排序算法也有很多种。起泡法是众所周知的排序算法，
//其原理是每次将相邻两个数进行比较，较大的下沉。其的主 ...
www.eeworm.com/read/293680/8280022
suo 起泡法.suo
www.eeworm.com/read/293680/8280024
ncb 起泡法.ncb
www.eeworm.com/read/392750/8328190
txt 牛顿法.txt
syms x1 x2 xk xk2 gk gk2 Gk Gk2 g G i ni zhuan n fx
f=x1^2+x2^2+x1*x2;
g=jacobian(f);
G=jacobian(g);
x1=3;x2=-1;
gk=subs(g);
Gk=subs(G);
i=1
ni=inv(Gk);
n=20;
xk=[3,-1]
ni*gk'
while(n>0.0
www.eeworm.com/read/370779/9586034
c 回溯法.c
#include
#define N 4
int c[N][N];
unsigned int mincost=65535;
int task[N],temp[N],worker[N];
void plan(int k, unsigned int cost)
{
int i;
if (k>=N&&cost
www.eeworm.com/read/367982/9721451
txt 冒泡法.txt
void sort(int A[],int n)
{
int i, j;
int t;
for(i=0; i
www.eeworm.com/read/268899/11115095