Interview Preparation topic: Recursive Function - Revision history

Proj user18 at 22:57, 18 December 2016

2016-12-18T22:57:53Z

Proj user18 at 22:55, 18 December 2016

2016-12-18T22:55:51Z

Proj user18 at 22:54, 18 December 2016

2016-12-18T22:54:34Z

Proj user18 at 21:10, 18 December 2016

2016-12-18T21:10:25Z

Proj user18 at 21:08, 18 December 2016

2016-12-18T21:08:30Z

Proj user18 at 21:04, 18 December 2016

2016-12-18T21:04:55Z

Proj user18 at 21:04, 18 December 2016

2016-12-18T21:04:11Z

Proj user18 at 21:01, 18 December 2016

2016-12-18T21:01:51Z

Proj user18 at 20:53, 18 December 2016

2016-12-18T20:53:29Z

Proj user18 at 20:48, 18 December 2016

2016-12-18T20:48:13Z

← Older revision		Revision as of 22:57, 18 December 2016
Line 1:		Line 1:
		+	'''RECURSION'''
		+
		+
	Recursion is the process of repeating items in a self-similar way.		Recursion is the process of repeating items in a self-similar way.

@@ Line 61: / Line 61: @@
+    }
-<syntaxhighlight>
+</syntaxhighlight>
 When the above code is compiled and executed, it produces the following result:
@@ Line 105: / Line 105: @@
+    }
-<syntaxhighlight>
+</syntaxhighlight>
 When the above code is compiled and executed, it produces the following result:
@@ Line 152: / Line 152: @@
+    }
-<syntaxhighlight>
+</syntaxhighlight>
 When the above code is compiled and executed, it produces the following result:

@@ Line 3: / Line 3: @@
 If a program allows you to call a function inside the same function, then it is called a recursive call of the function.
-<pre>
+<syntaxhighlight lang="C">
 void recursion()
+    {
@@ Line 17: / Line 17: @@
+    }
-</pre>
+</syntaxhighlight>
 While using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
@@ Line 32: / Line 32: @@
 The following example calculates the sum of natural numbers using a recursive function:
-<pre>
 #include <stdio.h>
@@ Line 60: / Line 61: @@
+    }
-</pre>
+<syntaxhighlight>
 When the above code is compiled and executed, it produces the following result:
@@ Line 79: / Line 80: @@
 The following example calculates the factorial of a given number using a recursive function:
-<pre>
+<syntaxhighlight lang="C">
 #include <stdio.h>
@@ Line 104: / Line 105: @@
+    }
-</pre>
+<syntaxhighlight>
 When the above code is compiled and executed, it produces the following result:
@@ Line 116: / Line 117: @@
 The following example generates the Fibonacci series for a given number using a recursive function:
-<pre>
+<syntaxhighlight lang="C">
 #include <stdio.h>
@@ Line 151: / Line 152: @@
+    }
-</pre>
+<syntaxhighlight>
 When the above code is compiled and executed, it produces the following result:

@@ Line 20: / Line 20: @@
 While using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
 Recursive functions are very useful to solve many mathematical problems, such as calculating sum of natural numbers, calculating the factorial of a number, generating Fibonacci series, etc.
-'''SUM OF NATURAL NUMBERS'''
+'''Example 1: SUM OF NATURAL NUMBERS'''
@@ Line 70: / Line 74: @@
-'''FACTORIAL OF A NUMBER'''
+'''Example 2: FACTORIAL OF A NUMBER'''
@@ Line 108: / Line 112: @@
-'''FIBONACCI SERIES'''
+'''Example 3: FIBONACCI SERIES'''

@@ Line 21: / Line 21: @@
 While using recursion, programmers need to be careful to define an exit condition from the function, otherwise it will go into an infinite loop.
-Recursive functions are very useful to solve many mathematical problems, such as calculating the factorial of a number, generating Fibonacci series, etc.
+Recursive functions are very useful to solve many mathematical problems, such as calculating sum of natural numbers, calculating the factorial of a number, generating Fibonacci series, etc.
@@ Line 109: / Line 155: @@
 '''Discussions'''

← Older revision		Revision as of 21:04, 18 December 2016
Line 110:		Line 110:

	'''SUM OF NATURAL NUMBERS'''		'''SUM OF NATURAL NUMBERS'''
		+

	The following example calculates the sum of natural numbers using a recursive function:		The following example calculates the sum of natural numbers using a recursive function:

@@ Line 6: / Line 6: @@
 void recursion()
+    {
     recursion(); /* function calls itself */
+    }
 int main()
+    {
     recursion();
+    }
 </pre>
@@ Line 32: / Line 36: @@
 int  main()
+    {
     int number = 5;
     printf("Factorial of %d is %d\n", number, factorial(number));
     return 0;
+    }
@@ Line 46: / Line 52: @@
     return i * factorial(i - 1);
+    }
 </pre>
@@ Line 66: / Line 73: @@
 int  main()
+    {
     int number=8;
@@ Line 74: / Line 82: @@
     return 0;
+    }
@@ Line 90: / Line 99: @@
     return fibonacci(i-1) + fibonacci(i-2);
+    }
 </pre>
@@ Line 109: / Line 119: @@
 int main()
+    {
-    int number, result;
-    number = 5;
+    int result;
     result = sum(number);
     printf("Sum of %d Natural Numbers Using Recursion is %d\n",number, result);
+    }

@@ Line 5: / Line 5: @@
 <pre>
 void recursion()
-−
+   {
     recursion(); /* function calls itself */
-−
+   }
 int main()
-−
+   {
     recursion();
-−
+   }
 </pre>
@@ Line 27: / Line 27: @@
 <pre>
 #include <stdio.h>
 int factorial(unsigned int i)
+    {
     if(i <= 1)
+       {
        return 1;
+       }
     return i * factorial(i - 1);
+    }
 </pre>
@@ Line 57: / Line 61: @@
 <pre>
 #include <stdio.h>
 int fibonacci(int i)
+    {
     if(i == 0)
+       {
@@ Line 68: / Line 88: @@
        return 1;
+       }
     return fibonacci(i-1) + fibonacci(i-2);
+    }
 </pre>
@@ Line 108: / Line 117: @@
 int sum(int num)
+    {
     if (num != 0)
-   return num + sum(num - 1); // sum() function calls itself
     else
-   return num;
+    }
 </pre>

← Older revision		Revision as of 20:53, 18 December 2016
Line 20:		Line 20:


−	'''~~Number Factorial~~'''	+	'''FACTORIAL OF A NUMBER'''


Line 29:		Line 29:

	int factorial(unsigned int i)		int factorial(unsigned int i)
−	{	+	{
	if(i <= 1)		if(i <= 1)
−	{	+	{
	return 1;		return 1;
−	}	+	}
	return i * factorial(i - 1);		return i * factorial(i - 1);
−	}	+	}

	int main()		int main()
−	{	+	{
	int i = 5;		int i = 5;
	printf("Factorial of %d is %d\n", i, factorial(i));		printf("Factorial of %d is %d\n", i, factorial(i));
	return 0;		return 0;
−	}	+	}
	</pre>		</pre>

Line 51:		Line 51:


−	'''~~Fibonacci Series~~'''	+	'''FIBONACCI SERIES'''


Line 58:		Line 58:
	#include <stdio.h>		#include <stdio.h>
	int fibonacci(int i)		int fibonacci(int i)
−	{	+	{
	if(i == 0)		if(i == 0)
−	{	+	{
	return 0;		return 0;
−	}	+	}

	if(i == 1)		if(i == 1)
−	{	+	{
	return 1;		return 1;
−	}	+	}
	return fibonacci(i-1) + fibonacci(i-2);		return fibonacci(i-1) + fibonacci(i-2);
−	}	+	}

	int main()		int main()
−	{	+	{
	int i;		int i;

	for (i = 0; i < 7; i++)		for (i = 0; i < 7; i++)
−	{	+	{
	printf("%d\t\n", fibonacci(i));		printf("%d\t\n", fibonacci(i));
−	}	+	}

	return 0;		return 0;
−	}	+	}
	</pre>		</pre>

Line 92:		Line 92:
	'''SUM OF NATURAL NUMBERS'''		'''SUM OF NATURAL NUMBERS'''

		+	The following example calculates the sum of natural numbers using a recursive function:
	<pre>		<pre>
	#include <stdio.h>		#include <stdio.h>
Line 98:		Line 99:

	int main()		int main()
−	{	+	{
−	int number, result;	+	int number, result;
−	number = 5;	+	number = 5;
−	result = sum(number);	+	result = sum(number);
−	printf("Sum of %d Natural Numbers Using Recursion is %d\n",number, result);	+	printf("Sum of %d Natural Numbers Using Recursion is %d\n",number, result);
−	}	+	}

	int sum(int num)		int sum(int num)
−	{	+	{
−	if (num != 0)	+	if (num != 0)
−	return num + sum(num - 1); // sum() function calls itself	+	return num + sum(num - 1); // sum() function calls itself
−	else	+	else
−	return num;	+	return num;
−	}	+	}
	</pre>		</pre>

@@ Line 87: / Line 87: @@
 <pre>
 	1	1	2	3	5	8
 </pre>
 '''Discussions'''