fibo.m

用0.618法和fibonacci法求解单变量的最优化问题

function y=fibo(k)
%This function generated the Fibonacci arry.
%This function output the kth entiy of Fibonacci arry.
n=k+1;

F(1)=1;
F(2)=1;

% % % for and if 语句产生Fibonacci序列
% if n<=2
%     y=F(n)
% else
%   for i=3:n
%     F(i)=F(i-1)+F(i-2);
%   end
%   y=F(i)
% end



% %用 while语句产生Fibonacci序列
switch n
    case 1
        y=F(1);
    case 2
        y=F(2);
    otherwise
        i=3;
        while i<=n
            F(i)=F(i-1)+F(i-2);
            i=i+1;
        end
        y=F(i-1);
end