A recursive function is one which defines a problem in terms of itself.<\/p>\n\n\n\n
A recursive function calls itself directly or indirectly until it is stopped. If it is not stopped, then it will call itself forever – or maybe until your browser crashes!<\/p>\n\n\n\n
Recursive functions let you perform a unit of work multiple times. And while it is similar to a for\/while loop<\/span><\/strong>, using a recursive solution affords a unique, faster and much more elegant approach to solving a problem.<\/p>\n\n\n\n Let’s write a countdown function, shall we?<\/p>\n\n\n\n 2. Using Recursion<\/p>\n\n\n\n A recursive function usually contains what is referred to as a “base case.”<\/span><\/strong><\/p>\n\n\n\n A base case<\/span><\/strong> is a condition that checks and stops the recursion. It essentially prevents an infinite loop.<\/p>\n\n\n\n In the above example, the snippet below:<\/p>\n\n\n\n is the base case, a condition that checks our program.<\/p>\n\n\n\n More examples<\/strong> …<\/p>\n\n\n\n Supposing we want to write a solution that performs a raise-to-power operation, eg., 23<\/sup>.<\/p>\n\n\n\n We can use the inbuilt Math function in Javascript like so:<\/p>\n\n\n\n We can also write a Loop solution as follows:<\/p>\n\n\n\n And then we can think in terms of recursion<\/span><\/strong> by doing the following:<\/p>\n\n\n\n Task: Sum all numbers till the given one.<\/p>\n\n\n\n E.g 5 = 1+2+3+4+5 = 15;<\/p>\n\n\n\n Using recursion,<\/strong> we would do the following<\/p>\n\n\n\n There you go. you can start using recursion for your automated programming tasks.<\/p>\n","protected":false},"excerpt":{"rendered":" A recursive function is one which defines a problem in terms of itself. A recursive function calls itself<\/p>\n","protected":false},"author":1,"featured_media":79,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[11],"tags":[12],"class_list":["post-78","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-javascript","tag-recursive-functions"],"yoast_head":"\ncountDown = (num) => {\nfor(let i=num; i>0; i--){\nconsole.log(i);\n}\n}\ncountDown(6) \/\/5,4,3,2,1<\/code><\/pre>\n\n\n\ncountDown = (num) => {\nif(num === 0)\nreturn 0;\nconsole.log(num);\ncountDown(num - 1);\n}\n\ncountDown(6) \/\/5,4,3,2,1<\/code><\/pre>\n\n\n\nif(num === 0)\nreturn;<\/code><\/pre>\n\n\n\nMath.pow(2,3)\n\/\/result is 8<\/code><\/pre>\n\n\n\npow = (a, b) => {\nlet result = 1;\nfor(let i=0; i<b; i++){\nresult *=a;\n}\nreturn result;\n}\n\nalert(pow(2,3));\n\/\/result is 8\n <\/code><\/pre>\n\n\n\npow = (a, b) => {\nif(n==1){\nreturn a;\n}else{\nreturn a * pow(a, b-1);\n}\n}\n\nalert(pow(2,3));\n\/\/result is 8<\/code><\/pre>\n\n\n\nsumAll = (n) => {\nif(n === 0){\nreturn 0;\n}else{\nreturn n += sumAll(n-1);\n}\n}\n\nalert(sumAll(5)) \/\/15<\/code><\/pre>\n\n\n\n