Answer:
I would say the second one
Explanation:
it makes sense cause if you're able to fix the problem that's how. if not then the last one
Answer:
In Python:
def fib(nterms):
n1, n2 = 1, 1
count = 0
while count < nterms:
term = n1
nth = n1 + n2
n1 = n2
n2 = nth
count += 1
return term
Explanation:
This line defines the function
def fib(nterms):
This line initializes the first and second terms to 1
n1, n2 = 1, 1
This line initializes the Fibonacci count to 0
count = 0
The following while loops gets the number at the position of nterms
<em> while count < nterms:
</em>
<em> term = n1
</em>
<em> nth = n1 + n2
</em>
<em> n1 = n2
</em>
<em> n2 = nth
</em>
<em> count += 1
</em>
This returns the Fibonnaci term
return term
The answer is (C)
In pure functional programming loops are replaced by recursive calls
On Excel, you click the Formulas tab.
There’s no solution to the equation