Mutual recursion: Difference between revisions
Content added Content deleted
(CoffeeScript: use native Array#map instead of array comprehension to further simplify code.) |
m (Added LSL.) |
||
Line 857: | Line 857: | ||
show cascade 20 [lput f #-1 ?] [] |
show cascade 20 [lput f #-1 ?] [] |
||
[0 0 1 2 2 3 4 4 5 6 6 7 7 8 9 9 10 11 11 12]</lang> |
[0 0 1 2 2 3 4 4 5 6 6 7 7 8 9 9 10 11 11 12]</lang> |
||
=={{header|LSL}}== |
|||
To test it yourself; rez a box on the ground, and add the following as a New Script. |
|||
<lang LSL>integer iDEPTH = 100; |
|||
integer f(integer n) { |
|||
if(n==0) { |
|||
return 1; |
|||
} else { |
|||
return n-m(f(n - 1)); |
|||
} |
|||
} |
|||
integer m(integer n) { |
|||
if(n==0) { |
|||
return 0; |
|||
} else { |
|||
return n-f(m(n - 1)); |
|||
} |
|||
} |
|||
default { |
|||
state_entry() { |
|||
integer x = 0; |
|||
string s = ""; |
|||
for(x=0 ; x<iDEPTH ; x++) { |
|||
s += (string)(f(x))+" "; |
|||
} |
|||
llOwnerSay(llList2CSV(llParseString2List(s, [" "], []))); |
|||
s = ""; |
|||
for(x=0 ; x<iDEPTH ; x++) { |
|||
s += (string)(m(x))+" "; |
|||
} |
|||
llOwnerSay(llList2CSV(llParseString2List(s, [" "], []))); |
|||
} |
|||
}</lang> |
|||
Output: |
|||
<pre>1, 1, 2, 2, 3, 3, 4, 5, 5, 6, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 14, 15, 16, 16, 17, 17, 18, 19, 19, 20, 21, 21, 22, 22, 23, 24, 24, 25, 25, 26, 27, 27, 28, 29, 29, 30, 30, 31, 32, 32, 33, 34, 34, 35, 35, 36, 37, 37, 38, 38, 39, 40, 40, 41, 42, 42, 43, 43, 44, 45, 45, 46, 46, 47, 48, 48, 49, 50, 50, 51, 51, 52, 53, 53, 54, 55, 55, 56, 56, 57, 58, 58, 59, 59, 60, 61, 61 |
|||
0, 0, 1, 2, 2, 3, 4, 4, 5, 6, 6, 7, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, 14, 14, 15, 16, 16, 17, 17, 18, 19, 19, 20, 20, 21, 22, 22, 23, 24, 24, 25, 25, 26, 27, 27, 28, 29, 29, 30, 30, 31, 32, 32, 33, 33, 34, 35, 35, 36, 37, 37, 38, 38, 39, 40, 40, 41, 42, 42, 43, 43, 44, 45, 45, 46, 46, 47, 48, 48, 49, 50, 50, 51, 51, 52, 53, 53, 54, 54, 55, 56, 56, 57, 58, 58, 59, 59, 60, 61, 61</pre> |
|||
=={{header|Lua}}== |
=={{header|Lua}}== |