代码搜索：查表法
找到约 10,000 项符合「查表法」的源代码
代码结果 10,000
www.eeworm.com/read/383218/8960419
c 追赶法.c
#include
#define N 10
void main()
{
float a[N],b[N],c[N],f[N];
int i,n,j;
printf("input n:");
scanf("%d",&n);
printf("input a:\n");
for(i=2;i
www.eeworm.com/read/282606/9080486
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/381188/9105758
doc matcom法.doc
www.eeworm.com/read/378042/9252888
map 冒泡法.map
www.eeworm.com/read/378042/9252892
lst 冒泡法.lst
冒泡法.asm Assembled with CASMW 2007-11-5 9:10:47 PAGE 1
0000 1 address1 EQU $40
0000 2 address2 EQU $42
0000 3 n1 EQU $
www.eeworm.com/read/378042/9252894
err 冒泡法.err
CASM08 - Command line ASseMbler - Version 3.11 - SLD
P&E Microcomputer Systems, Inc.
Successful assembly - No errors.
Total lines assembled : 55
www.eeworm.com/read/378042/9252904
asm 冒泡法.asm
address1 EQU $40
address2 EQU $42
n1 EQU $44
temp equ $45
flag equ $46
org $0060
ORG $8000
Main:
db 20,30,55,42,33,10,80,60,40,57,77,12,23,
www.eeworm.com/read/377037/9296998
c 追赶法.c
#include
#define N 10
void main()
{
float a[N],b[N],c[N],f[N];
int i,n,j;
printf("input n:");
scanf("%d",&n);
printf("input a:\n");
for(i=2;i
www.eeworm.com/read/376627/9311811
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/373853/9432305