tetotw.m

来自「遗传优化算法」· M 代码 · 共 20 行

function two=tetotw(ten,n);
a=[];
m=length(ten);
for i=1:m
   j=n;   
   while (j>=1)
      if mod(ten(i),2)==0
         a(i,j)=0;
      elseif mod(ten(i),2)==1
        a(i,j)=1;
      end
      if mod(ten(i),2)==1
         ten(i)=round(ten(i)/2)-1;
      elseif mod(ten(i),2)==0
         ten(i)=ten(i)/2;
      end
      j=j-1;  
   end
end
two=a;