3. The recursive Fibonacci function is inefficient because (5%)
(A) it does many repeated computations
(B) recursion is inherently inefficient compared to iteration
(C) calculating Fibonacci numbers is intractable
(D) fibbing is morally wrong

相關試題

相關試卷