{"id":37211,"date":"2016-08-29T10:45:46","date_gmt":"2016-08-29T15:45:46","guid":{"rendered":"http:\/\/luispalominotblog.wordpress.com\/?p=468"},"modified":"2016-08-29T10:45:46","modified_gmt":"2016-08-29T15:45:46","slug":"recursion","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101fall2016\/syndicated\/recursion\/","title":{"rendered":"Recursion"},"content":{"rendered":"

--Originally published at Programming<\/a><\/a><\/em>
<\/p>\n

Definition<\/h2>\n

It’s time to start taking on more advanced topics. Recursion is a way to code a problem, in which a function calls itself several times withing its body. In mathematical terms a recursive function is a function that is defined in terms of itself. If a function fulfills the definition of recursion, it is then called a recursive function.<\/p>\n

Terminate a recursive function<\/h2>\n

A recursive function needs to be terminated in a program. A recursive function is terminated when the solution of the problem is reduced and\u00a0reaches a base case. A base case is defined as the case when the problem doesn’t require further recursion in order to be solved.<\/p>\n

Example<\/h2>\n

The factorial of a number would be a recursive problem. A simple way to make a program to get the factorial of a number n is on the left, and on the right we can find the same problem using recursion.<\/p>\n

\"2.png\"\"1.png\"<\/p>\n

 <\/p>\n

 <\/p>\n

 <\/p>\n

Let’s track how the recursive function works by adding print functions to the previous function definition.<\/p>\n

\"3.png\"<\/p>\n

\"4.png\"<\/p>\n

If you want to learn deeper\u00a0about this topic I recommend you to read the following article that explains how to use recursion.\u00a0http:\/\/openbookproject.net\/thinkcs\/python\/english3e\/recursion.html<\/p>\n

 <\/p>
\"\"<\/a> \"\"","protected":false},"excerpt":{"rendered":"

–Originally published at Programming Definition It’s time to start taking on more advanced topics. Recursion is a way to code a problem, in which a function calls itself several times withing its body. In mathematical terms a recursive function is a function that is defined in terms of itself. If a function fulfills the definition … Continue reading Recursion<\/span><\/a><\/p>\n","protected":false},"author":14,"featured_media":483,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[146,24],"class_list":["post-37211","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-tc101-python-recursion-infinity","tag-python"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts\/37211","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/users\/14"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/comments?post=37211"}],"version-history":[{"count":2,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts\/37211\/revisions"}],"predecessor-version":[{"id":38372,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts\/37211\/revisions\/38372"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/media?parent=37211"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/categories?post=37211"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/tags?post=37211"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}