#Mastery21<\/a> about using recursion in algorithms. A recursion refers to the action of when a function calls itself. It is kind of like creating a loop.<\/span><\/p>\n<\/p>\n
96<\/p>\n
<\/p>\n
Normal
\n 0<\/p>\n
21<\/p>\n
false
\n false
\n false<\/p>\n
ES-TRAD
\n X-NONE
\n X-NONE<\/p>\n
<\/p>\n
<\/p>\n
\/* Style Definitions *\/
\ntable.MsoNormalTable
\n\t{mso-style-name:”Tabla normal”;
\n\tmso-tstyle-rowband-size:0;
\n\tmso-tstyle-colband-size:0;
\n\tmso-style-noshow:yes;
\n\tmso-style-priority:99;
\n\tmso-style-parent:””;
\n\tmso-padding-alt:0cm 5.4pt 0cm 5.4pt;
\n\tmso-para-margin:0cm;
\n\tmso-para-margin-bottom:.0001pt;
\n\tmso-pagination:widow-orphan;
\n\tfont-size:12.0pt;
\n\tfont-family:Calibri;
\n\tmso-ascii-font-family:Calibri;
\n\tmso-ascii-theme-font:minor-latin;
\n\tmso-hansi-font-family:Calibri;
\n\tmso-hansi-theme-font:minor-latin;
\n\tmso-fareast-language:EN-US;}<\/p>\n
<\/p>\n
Why? Calling the function inside the function creates a series of events which lead to the result that is the same using a lop with while or for.<\/span><\/p>\n<\/span><\/p>\n <\/p>\n
\n- In recursion, a function calls itself but you shouldn’t assume these two functions are same function. <\/li>\n
- Local variables are defined inside a function and has scope only inside that function. In recursion, a function call itself.<\/li>\n<\/ul>\n
<\/p>\n
Recursion makes it easier to express ideas in which the result of the recursive needs to complete the task.<\/span><\/p>\n