代码搜索:Num
找到约 10,000 项符合「Num」的源代码
代码结果 10,000
www.eeworm.com/read/276181/10758395
c 递推.c
#define NUM 10
#include
int i[NUM];
main()
{
int sum,n,total,k,flag,count=0;
printf("Please enter requried terms(
www.eeworm.com/read/276181/10758476
c 递归车厢.c
/**********递归题改为非递归题实例 车厢********/
#include
#define MAX 4
int stack[MAX],p=-1;
struct
{
int num;
int sign;
}train[MAX];
void sub()
{
int inc;
if(p==MAX-
www.eeworm.com/read/350192/10760214
cpp shellsort.cpp
#include
#include//include function setw();
//#include
using namespace std;
void InsertSort(int r[], int n)
{
int i,j,x,d;
d=n/2;
while(d>=1)
{
for(i=d;i
www.eeworm.com/read/350189/10760285
cpp quicksort.cpp
#include
#include
#include
#define NUM 20
using namespace std;
cmp(const void *a, const void *b)
{
if(*(int *)a>*(int *)b) return 1;
else if(*(int *)a==*(int *
www.eeworm.com/read/350187/10760543
cpp insertsort.cpp
#define NUM 20
#include
#include
void InsertSort(int r[ ],int n)
{
int i,j;
int x;
for(i=1;i=0;j--)
if(r[j]>x)
r[j+1
www.eeworm.com/read/276015/10775254
m psoqiaoshikkd.m
clear;clc;
popsize=20;num=5;
bujian=zeros(popsize,num+3); %第num+3列放系统可靠度,系统费用,适应值
newbujian=zeros(popsize,num+3);
vol=zeros(popsize,num);
c1=1.4962;c2=1.4962;
max
www.eeworm.com/read/350026/10775893
java logoscreen.java
import javax.microedition.lcdui.*;
public class logoScreen
{
Image logo1=null;
Image logo2=null;
myCanvas mc=null;
int which=0;
int Num=0;
public logoScreen(myCanvas mc)
{
this.mc=m