https://wiki.expertiza.ncsu.edu/index.php?action=history&feed=atom&title=CSC_216_F09%2FRecursion_ExerciseCSC 216 F09/Recursion Exercise - Revision history2026-05-07T08:58:42ZRevision history for this page on the wikiMediaWiki 1.41.0https://wiki.expertiza.ncsu.edu/index.php?title=CSC_216_F09/Recursion_Exercise&diff=28055&oldid=prevSjlouder at 04:37, 18 November 20092009-11-18T04:37:22Z<p></p>
<p><b>New page</b></p><div>==Background==<br />
This is a simple exercise for finding recursive equations and writing them as Java code.<br />
<br />
<br />
===Props===<br />
1. Whiteboard<br />
<br />
2. Access to a Java editor<br />
<br />
===Procedure===<br />
<br />
1) Give each row a sequence of numbers. <br />
<br />
Ex:<br />
<br />
a) 2, 6, 10, 14,...<br />
<br />
b) 0, 1, 0, 1...<br />
<br />
c) 2, 6, 12, 20...<br />
<br />
d) 1, 4, 9, 16...<br />
<br />
<br />
2) Then have each row work together to find the recursive definition for the sequences.<br />
<br />
Ex:<br />
<br />
a) 4n-2<br />
<br />
b) 1+(-1)^n<br />
<br />
c) n(n + 1)<br />
<br />
d) n^2<br />
<br />
<br />
3) Lastly, each group should write Java code to implement the recursive equation and submit via Google Docs. <br />
<br />
Ex:<br />
<br />
a) <br />
<br />
public int recursion( int n ){<br />
int a = 0;<br />
if(n == 1) a = 2;<br />
else a = recursion( n - 1 ) + 4;<br />
return a;<br />
}<br />
<br />
By: David Duran & Dereck Allred</div>Sjlouder