擅长:python、mysql、java
<blockquote>
<p>does the 'finobacci(number-1)' completes all the recursion until it reaches '1' and then it does the same with 'fibonacci(number-2)' and add them?</p>
</blockquote>
<p>是的,完全正确。换句话说,下面</p>
<pre><code>return fibonacci(number-1) + fibonacci(number-2)
</code></pre>
<p>相当于</p>
<pre><code>f1 = fibonacci(number-1)
f2 = fibonacci(number-2)
return f1 + f2
</code></pre>