代码搜索：交换技术
找到约 10,000 项符合「交换技术」的源代码
代码结果 10,000
www.eeworm.com/read/443342/7634353
m shuffle.m
function is = shuffle(is)
%打乱染色体次序
N = length(is);
for n = N:-1:2
in = ceil(rand*(n - 1));
tmp = is(in);is(in) = is(n); is(n) = tmp; %将第n个元素与第in个元素交换
end
www.eeworm.com/read/443327/7634577
m shuffle.m
function is = shuffle(is)
%打乱染色体次序
N = length(is);
for n = N:-1:2
in = ceil(rand*(n - 1));
tmp = is(in);is(in) = is(n); is(n) = tmp; %将第n个元素与第in个元素交换
end
www.eeworm.com/read/396269/8117551
m shuffle.m
function is = shuffle(is)
%打乱染色体次序
N = length(is);
for n = N:-1:2
in = ceil(rand*(n - 1));
tmp = is(in);is(in) = is(n); is(n) = tmp; %将第n个元素与第in个元素交换
end
www.eeworm.com/read/246680/12713054
m shuffle.m
function is = shuffle(is)
%打乱染色体次序
N = length(is);
for n = N:-1:2
in = ceil(rand*(n - 1));
tmp = is(in);is(in) = is(n); is(n) = tmp; %将第n个元素与第in个元素交换
end
www.eeworm.com/read/143119/12898021
h paixu.h
class paixu
{
public:
double compare; //元素比较次数
double move; //元素移动次数
double exchange; //元素交换次数
double time;
void insertsort(int r[],long m,long n);
void shellsort(int r[
www.eeworm.com/read/327183/13096015
txt paixubijiao.txt
⑴插入排序。
⑵交换排序。
⑶选择排序。
⑷归并排序。
⑸基数排序。
#define MAXSIZE 20
#define LT(a,b) ((a)
www.eeworm.com/read/320510/13425722
java swap.java
package oop;
//两个int变量实现交换
public class Swap {
public static void swap(int[] array,int i,int j){
int temp=array[i];
array[i]=array[j];
array[j]=temp;
}
}
www.eeworm.com/read/255920/12046185
m sum1.m
%一次交换主程序
%=======================================================
%先输入计算参数
halfwindow=5;t=3000;high=30;halfwidth=20;
%调用程序进行计算
diffus=moon_diffu(halfwindow,t,high,halfwidth);
fdiffus=fliplr(diff