代码搜索：查表法

找到约 10,000 项符合「查表法」的源代码

代码结果 10,000
热门代码： main.c GPIO I2C SPI UART timer interrupt ADC PWM LED
www.eeworm.com/read/450798/7476721

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/450363/7485122

bmp 11 追赶法.bmp

·
www.eeworm.com/read/450363/7485125

cpp 梯形法积分.cpp

#include #include float A,B; float y(float x) {return A*x*x+B;} void main() {float a,b,x,h,sum,trapz; int i,n; printf("请输入抛物线y=Ax(2)+B的系数A,B:"); scanf("%f%f",&A,&B); pri
·
www.eeworm.com/read/449694/7497924

c 冒泡法改进.c

/* 冒泡法是数据排序的一种基本算法,它的基本方法是:相邻两元素进行比较,如有需要则进行交换, 每完成一次循环就将最小元素排在最后(如从大到小排序),下一次循环是将其他的数进行类似操作? 如将N 个数按从大到小排序,Turbo C语言程序函数 如下: */ void sort(int a[],int n);
·
www.eeworm.com/read/449694/7497929

c 穷举搜索法.c

·
www.eeworm.com/read/449694/7497931

c 递堆法.c

·
www.eeworm.com/read/449694/7498013

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/445609/7592636

bas gaosijordan消去法.bas

Attribute VB_Name = "GaosiJordan消去法" '''GAUSS-Jordan-??????????.TXT Sub GAUSSJ(A() As Double, n, B() As Double) ReDim IPIV(n), INDXR(n), INDXC(n) For J = 1 To n IPIV(J) = 0
·
www.eeworm.com/read/445241/7597610

doc 劳动法.doc

·
www.eeworm.com/read/441836/7664164

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
·