Recursion (computer science): Difference between revisions

Content deleted Content added
m Reverted edits by 66.188.249.167 (talk) to last version by 9FW
mNo edit summary
Line 13:
| chapter-url = http://www-cs-faculty.stanford.edu/~knuth/gkp.html
| chapter=1: Recurrent Problems
}}</ref> <ref>{{cite journal|title=Teaching Recursive Thinking using Unplugged Activities|journal=WTE&TE|volume=19|pages=169 - 175|year=2021|last1=Kuhail|first1=M. A. |last2=Negreiros|first2=J. |last3=Seffah|first3=A. |url = http://www.wiete.com.au/journals/WTE&TE/Pages/Vol.19,%20No.%202%20(2021)/03-Kuhail-M.pdf}}</ref> Recursion solves such [[recursion|recursive problems]] by using [[function (computer science)|functions]] that call themselves from within their own code. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.<ref>{{cite book
|author-last = Epp
|author-first = Susanna