求助一个数据结构的求时间复杂度问题# Programming - 葵花宝典
t*s
1 楼
望给出详细说明，谢谢
function recursive (n:integer):integer;
begin
if n<=1 then
return (1)
else
return (recursive(n-1)+recursive (n-1))
end
function recursive (n:integer):integer;
begin
if n<=1 then
return (1)
else
return (recursive(n-1)+recursive (n-1))
end
