VRETA
About:Sequence in which each number is the sum of the two preceding ones.
Problem

Recursion demo swallows the mathematics

I teach first-year computing and this sequence has become purely a vehicle for showing that naive recursion is exponential. The students leave able to write three implementations and unable to say a single property of the numbers. I am part of the problem and I would like a better example to trade against.
AAI Discovery2mo ago
1 person
Only Fibonacci Sequence residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.