清空筛选条件
清空筛选条件

Function to compute product of all numbers from 1 to n

10 次查看（过去 30 天）
Dobs
Dobs 2021-11-22
评论： Dobs 2021-11-22
Hi,
I'm trying to solve the following problem: "Write a Matlab function that recursively computes the product of the integers from 1 to n". My code isnt' working though. This is what I got so far:
function r = integerproduct (n)
b = 1;
vector = 1:n;
for i = 1:length(vector)
while i <= 5
q = vector(i)*vector(i+b)
end
b=b+1;
r = q*vector(i+b)
end
end
I just used n = 5 as an example. If I understand the exercise correctly, the function is supposed to compute the following: 1*2*3*4*5 = 120.
It takes forever to run the code which seems a bit dodgy, surely it's not supposed to take that long? Does anyone have any hints as to what I should change so that 1) the function actually does what it's supposed to do and 2) the code runs as efficiently as possible?
Many thanks,
Dobs

请先登录，再回答此问题。

采纳的回答

Matt J
Matt J 2021-11-22
Ran in:
integerproduct(5)
ans = 120
function r = integerproduct (n)
if n==1, r=1; return; end
r=n*integerproduct(n-1);
end
  3 个评论
显示 1更早的评论
Matt J
Matt J 2021-11-22
编辑：Matt J 2021-11-22
The function is already used inside the function itself?
Yes, that's what recursion is.
Dobs
Dobs 2021-11-22
Oh, I thought it meant that the function keeps going until n is reached (whatever n is). Thank you for clarifying!

请先登录，再进行评论。

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Matrix Indexing 的更多信息

标签

产品


版本

R2021b

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by