{"id":39015,"date":"2016-11-22T11:09:43","date_gmt":"2016-11-22T17:09:43","guid":{"rendered":"http:\/\/a01228858.wordpress.com\/?p=271"},"modified":"2016-11-22T11:09:43","modified_gmt":"2016-11-22T17:09:43","slug":"use-of-recursion-for-repetitive-algorithms-7","status":"publish","type":"post","link":"https:\/\/kenscourses.com\/tc101fall2016\/syndicated\/use-of-recursion-for-repetitive-algorithms-7\/","title":{"rendered":"Use of recursion for repetitive algorithms"},"content":{"rendered":"<p class=\"syndicated-attribution\"><em> --Originally published at <a href=\"https:\/\/a01228858.wordpress.com\/2016\/11\/22\/use-of-recursion-for-repetitive-algorithms\/\"><a href=\"https:\/\/a01228858.wordpress.com\">Py(t)hon<\/a><\/a><\/em><br \/><\/p>\n<p>This time we are going to learn about recursion, what is recursion? Recursion is a method where the solution to a problem is based on solving smaller instances of the same problem or in other words\u00a0\u00a0is a way of programming or coding a problem, in which a function calls itself one or more times in its body.<\/p>\n<p>An example is the function of the factorial:<\/p>\n<p><img class=\"alignnone size-full wp-image-279\" src=\"https:\/\/a01228858.files.wordpress.com\/2016\/11\/fact-1.png?w=1000\" alt=\"fact-1\" srcset=\"https:\/\/a01228858.files.wordpress.com\/2016\/11\/fact-1.png 326w, https:\/\/a01228858.files.wordpress.com\/2016\/11\/fact-1.png?w=150 150w, https:\/\/a01228858.files.wordpress.com\/2016\/11\/fact-1.png?w=300 300w\" sizes=\"(max-width: 326px) 100vw, 326px\"   \/><\/p>\n<p>Click <a href=\"http:\/\/www.python-course.eu\/recursive_functions.php\">here<\/a> for more examples.<\/p>\n<p>Here is a video for better understanding:<\/p>\n<div class=\"jetpack-video-wrapper\"><iframe class='youtube-player' type='text\/html' width='1000' height='593' src='https:\/\/www.youtube.com\/embed\/aogd9PnDiSo?version=3&#038;rel=1&%23038;fs=1&%23038;autohide=2&%23038;showsearch=0&%23038;showinfo=1&%23038;iv_load_policy=1&%23038;wmode=transparent' allowfullscreen='true' style='border:0;'><\/iframe><\/div>\n<p>#Pug#TC101#Tec#ISC#Recursion#NoMore<\/p><br \/>  <a rel=\"nofollow\" href=\"http:\/\/feeds.wordpress.com\/1.0\/gocomments\/a01228858.wordpress.com\/271\/\"><img alt=\"\" border=\"0\" src=\"http:\/\/feeds.wordpress.com\/1.0\/comments\/a01228858.wordpress.com\/271\/\" \/><\/a> <img alt=\"\" border=\"0\" src=\"https:\/\/pixel.wp.com\/b.gif?host=a01228858.wordpress.com&#038;blog=115152340&%23038;post=271&%23038;subd=a01228858&%23038;ref=&%23038;feed=1\" width=\"1\" height=\"1\" \/>","protected":false},"excerpt":{"rendered":"<p>&#8211;Originally published at Py(t)hon This time we are going to learn about recursion, what is recursion? Recursion is a method where the solution to a problem is based on solving smaller instances of the same problem or in other words\u00a0\u00a0is a way of programming or coding a problem, in which a function calls itself one &hellip; <a href=\"https:\/\/kenscourses.com\/tc101fall2016\/syndicated\/use-of-recursion-for-repetitive-algorithms-7\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">Use of recursion for repetitive algorithms<\/span><\/a><\/p>\n","protected":false},"author":28,"featured_media":279,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5,4],"tags":[34,376,42,286,33,36],"class_list":["post-39015","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-blogs","category-syndicated","tag-isc","tag-nomore","tag-pug","tag-recursion","tag-tc101","tag-tec"],"_links":{"self":[{"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts\/39015","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\/28"}],"replies":[{"embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/comments?post=39015"}],"version-history":[{"count":18,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts\/39015\/revisions"}],"predecessor-version":[{"id":42589,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/posts\/39015\/revisions\/42589"}],"wp:attachment":[{"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/media?parent=39015"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/categories?post=39015"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/kenscourses.com\/tc101fall2016\/wp-json\/wp\/v2\/tags?post=39015"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}