Eine gute Antwort wäre:

No. It does not mention the base cases.

Complete Rules

A recursive definition (or program) must have two parts:

  1. If the problem is easy, solve it immediately.
  2. If the problem can't be solved immediately, divide it into smaller problems, then:
    • Solve the smaller problems by applying this procedure to each of them.

Here is an expanded version of fib(N):

fib( ___ ) = _____       (base case)

fib( ___ ) = _____       (base case)

fib( N ) = fib( N-1 ) + fib( N-2 )
Fibonacci Series
N12345 678910
fib(N)11235 813213455



The rule seems to be plagued with blue blanks. Can you fill them?