代码搜索：伏安法
找到约 10,000 项符合「伏安法」的源代码
代码结果 10,000
www.eeworm.com/read/482925/6616257
exe 迭代回溯法.exe
www.eeworm.com/read/482925/6616258
ncb 迭代回溯法.ncb
www.eeworm.com/read/482925/6616259
cpp 迭代回溯法.cpp
#include
#include
#include
using namespace std;
class Queen
{
public:
Queen(int n)
{
size=n;
x=new int[size+1];
sum=0;
}
bool place(int row)
www.eeworm.com/read/482925/6616260
dsp 迭代回溯法.dsp
# Microsoft Developer Studio Project File - Name="迭代回溯法" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Con
www.eeworm.com/read/482386/6623793
txt 高斯消去法.txt
#include
#include
using namespace std;
int main()
{
int i,j,n,k;
// float A[n][n],m[n-1],B[n],x[n];
float A[500][500],m[500],B[300],x[300];
while(1)
{
www.eeworm.com/read/481249/6646396
c 冒泡法改进.c
/* 冒泡法是数据排序的一种基本算法,它的基本方法是:相邻两元素进行比较,如有需要则进行交换,
每完成一次循环就将最小元素排在最后(如从大到小排序),下一次循环是将其他的数进行类似操作?
如将N 个数按从大到小排序,Turbo C语言程序函数
如下: */
void sort(int a[],int n);
www.eeworm.com/read/481249/6646401
c 穷举搜索法.c
www.eeworm.com/read/481249/6646403
c 递堆法.c
www.eeworm.com/read/481249/6646480
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/263680/11348184