Recursive Definition Clarification
"Consider the following recursive definition, where n is a positive integer.
F(1) = 3
F(n) = F(n - 1) + 1 if n > 1
The value of F(3) is ____________________."
Can someone explain to me what this means? How is this represented in code form?
Thank you,
Alex.
F(1) = 3
F(n) = F(n - 1) + 1 if n > 1
The value of F(3) is ____________________."
Can someone explain to me what this means? How is this represented in code form?
Thank you,
Alex.
Topic archived. No new replies allowed.