Practice Questions for Recursion | Set 3
Explain the functionality of below recursive functions.
Question 1
void fun1(int n) { int i = 0; if (n > 1) fun1(n-1); for (i = 0; i < n; i++) printf(" * "); } |
chevron_right
filter_none
Answer: Total numbers of stars printed is equal to 1 + 2 + …. (n-2) + (n-1) + n, which is n(n+1)/2.
Question 2
#define LIMIT 1000 void fun2(int n) { if (n <= 0) return; if (n > LIMIT) return; printf("%d ", n); fun2(2*n); printf("%d ", n); } |
chevron_right
filter_none
Answer: For a positive n, fun2(n) prints the values of n, 2n, 4n, 8n … while the value is smaller than LIMIT. After printing values in increasing order, it prints same numbers again in reverse order. For example fun2(100) prints 100, 200, 400, 800, 800, 400, 200, 100.
If n is negative, the function is returned immediately.
Please write comments if you find any of the answers/codes incorrect, or you want to share more information about the topics discussed above.
Recommended Posts:
- Practice Questions for Recursion | Set 6
- Practice Questions for Recursion | Set 7
- Practice Questions for Recursion | Set 5
- Practice Questions for Recursion | Set 4
- Practice Questions for Recursion | Set 2
- Practice Questions for Recursion | Set 1
- Practice questions for Linked List and Recursion
- Recursive Practice Problems with Solutions
- Recursion
- Find the value of ln(N!) using Recursion
- Sum of the series 1^1 + 2^2 + 3^3 + ..... + n^n using recursion
- Tail Recursion
- Product of 2 Numbers using Recursion
- Sum of digit of a number using recursion
- Reverse a stack using recursion
Improved By : hoangdang