Recursive calls - Revision history

Arjun Suresh at 14:00, 14 April 2014

2014-04-14T14:00:38Z

Arjun Suresh at 16:42, 22 February 2014

2014-02-22T16:42:28Z

Arjun Suresh at 07:48, 16 December 2013

2013-12-16T07:48:07Z

Arjun Suresh at 07:47, 16 December 2013

2013-12-16T07:47:50Z

Arjun Suresh at 07:46, 16 December 2013

2013-12-16T07:46:51Z

Arjun Suresh at 14:03, 8 December 2013

2013-12-08T14:03:52Z

Arjun Suresh at 14:03, 8 December 2013

2013-12-08T14:03:38Z

Arjun Suresh at 14:03, 8 December 2013

2013-12-08T14:03:29Z

Arjun Suresh: Created page with "6. What value does function sum return when called with a value of 5? int sum (int n) { if (n < 1) return 1; else return n + sum(n - 1) + sum(..."

2013-12-08T14:03:06Z

Created page with "6. What value does function sum return when called with a value of 5? <syntaxhighlight lang="c"> int sum (int n) { if (n < 1) return 1; else return n + sum(n - 1) + sum(..."

New page

6. What value does function sum return when called with a value of 5?
<syntaxhighlight lang="c">
int sum (int n) {
if (n < 1) return 1;
else return n + sum(n - 1) + sum(n - 2);
}
</syntaxhighlight>

===Solution===
We have to find the value of sum(1), sum(2), sum(3), sum(4) and sum(5)

sum(1) = 1 + sum(0) + sum(-1) = 1 + 1 + 1 = 3

sum(2) = 2 + sum(1) + sum(0) = 2 + 3 + 1 = 6

sum(3) = 3 + sum(2) + sum(1) = 3 + 6 + 3 = 12

sum(4) = 4 + sum(3) + sum(2) = 4 + 12 + 6 = 22

sum(5) = 5 + sum(4) + sum(3) = 5 + 22 + 12 = 39

<div class="fb-like" data-layout="standard" data-action="like" data-show-faces="false" data-share="true"></div>

<div class="fb-share-button" data-type="button_count"></div>

<disqus/>

[[Category:Coding Questions]]

@@ Line 17: / Line 17: @@
   So, '''39''' is the answer
-{{Temlate:FBD}}
+{{Template:FBD}}
 [[Category:Coding Questions]]

← Older revision		Revision as of 14:03, 8 December 2013
Line 22:		Line 22:

	So, '''39''' is the answer		So, '''39''' is the answer
		+
		+

	<div class="fb-like" data-layout="standard" data-action="like" data-show-faces="false" data-share="true"></div>		<div class="fb-like" data-layout="standard" data-action="like" data-show-faces="false" data-share="true"></div>

← Older revision		Revision as of 14:03, 8 December 2013
Line 21:		Line 21:
	sum(5) = 5 + sum(4) + sum(3) = 5 + 22 + 12 = 39		sum(5) = 5 + sum(4) + sum(3) = 5 + 22 + 12 = 39

		+	So, '''39''' is the answer

	<div class="fb-like" data-layout="standard" data-action="like" data-show-faces="false" data-share="true"></div>		<div class="fb-like" data-layout="standard" data-action="like" data-show-faces="false" data-share="true"></div>

@@ Line 8: / Line 8: @@
-===Solution===
+==={{Template:Author|Arjun Suresh|{{arjunweb}} }}===
   We have to find the value of sum(1), sum(2), sum(3), sum(4) and sum(5)
   sum(1) = 1 + sum(0) + sum(-1) = 1 + 1 + 1 = 3

@@ Line 1: / Line 1: @@
 What value does function sum return when called with a value of 5?
-<syntaxhighlight lang="c">
+<syntaxhighlight lang="c" name="recursion_1">
 int sum (int n) {
     if (n < 1) return 1;

@@ Line 10: / Line 10: @@
 ===Solution===
   We have to find the value of sum(1), sum(2), sum(3), sum(4) and sum(5)
   sum(1) = 1 + sum(0) + sum(-1) = 1 + 1 + 1 = 3
   sum(2) = 2 + sum(1) + sum(0) = 2 + 3 + 1 = 6
   sum(3) = 3 + sum(2) + sum(1) = 3 + 6 + 3 = 12
   sum(4) = 4 + sum(3) + sum(2) = 4 + 12 + 6 = 22
   sum(5) = 5 + sum(4) + sum(3) = 5 + 22 + 12 = 39
   So, '''39''' is the answer