Content deleted Content added
No edit summary |
m MOS:APPENDIX; formatting: whitespace (using Advisor.js) |
||
Line 8:
'''else'''
'''return''' odd?(abs(number)-1)
'''function''' ''odd?''(number : '''Integer''')
'''if''' number == 0 '''then'''
Line 24:
In mathematics, the [[Hofstadter sequence#Hofstadter Female and Male sequences|Hofstadter Female and Male sequences]] are an example of a pair of integer sequences defined in a mutually recursive manner.
== References ==▼
* Manuel Rubio-Sánchez, Jaime Urquiza-Fuentes,Cristóbal Pareja-Flores (2002), 'A Gentle Introduction to Mutual Recursion', Proceedings of the 13th annual conference on Innovation and technology in computer science education, June 30–July 2, 2008, Madrid, Spain.▼
* [http://norvig.com/sudoku.html Solving Every Sudoku Puzzle]▼
== See also ==
* [[Recursion (computer science)]]
▲== References ==
▲* Manuel Rubio-Sánchez, Jaime Urquiza-Fuentes,Cristóbal Pareja-Flores (2002), 'A Gentle Introduction to Mutual Recursion', Proceedings of the 13th annual conference on Innovation and technology in computer science education, June 30–July 2, 2008, Madrid, Spain.
▲* [http://norvig.com/sudoku.html Solving Every Sudoku Puzzle]
[[Category:Theory of computation]]
| |||