Recursion is a technique in which the resolution of one problem depends on the resolution of a smaller problem of a big problem.
\nWith this, we divide the big problem into small problems and then solve them. To put it another way, a function calls itself in recursion to tackle smaller issue recursion. Recursion is a popular approach for solving problems because recursive solutions are generally easier to think about than their iterative counterparts and the code is also shorter and easier to understand.<\/p>\n
Recursion is consist of three steps as follows:<\/em><\/p>\n Microsoft <\/a>Windows 10 is a widely used operating system in computers all over the world. If you have skills in Microsoft Windows 10 then you can take our get a Windows 10 Certification<\/a> from StudySection which can help you in getting hired. A beginner level certification exam for newbies and an advanced level certification exam for experts are available on StudySection.<\/em><\/small><\/p>\n","protected":false},"excerpt":{"rendered":" What is Recursion? Recursion is a technique in which the resolution of one problem depends on the resolution of a<\/p>\n","protected":false},"author":1,"featured_media":6288,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[6],"tags":[826],"acf":[],"yoast_head":"\n\n
Example:<\/h3>\n
#include <iostream>
\nusing namespace std;
\nint fibo(int x) {
\nif((x==1)||(x==0)) {
\nreturn(x);
\n}else {
\nreturn(fibo(x-1)+fibo(x-2));
\n}
\n}
\nint main() {
\nint x , i=0;
\ncout << \"Enter the number of elements : \";
\ncin >> x;
\ncout << \"\\nFibonnaci Series : \";
\nwhile(i < x) {
\ncout << \" \" << fibo(i);
\ni++;
\n}
\nreturn 0;
\n}<\/code><\/p>\n