Recent questions tagged recursion

What is the output of the following code?#include <stdio.h int fun(int n) { if (n <= 1) return n; return fun(n - 1) + fun(n - 3); } int main() { printf("%d", fun(5)); ret...

What is the output of the following code?#include <stdio.h int fun(int n) { if (n == 0) return 1; return n * fun(n - 2); } int main() { printf("%d", fun(6)); return 0; }

What is the output of the following code?#include <stdio.h int calc(int n) { if (n == 1) return 2; return n + calc(n - 1); } int main() { printf("%d", calc(4)); return 0;...

Which of the following is correct order of increasing time complexity of algorithmsTower of Hanoi with $n$ disk.Binary search given $n$ sorted numbers.Heap sort given $n$...

​​​​​​A recursive function in Python is given.def mystery(n): if n <= 0: return 1 else: return mystery(n-1) + mystery(n-2)Now, consider the following function call:myster...

Consider the following ANSI-C function.int func(int start, int end){ int length=end+1-start; if((length<1)||(start<0)||(end<0)){ return(0); } if(length%3==0){ return(func...

Consider the recursive functions represented by the following code segment:int bar(int n) { if (n == 1) return 0; else return 1 + bar(n/2); } int foo(int n) { if (n == 1)...

#include <stdio.h>int mystery(int n) { if (n == 0) { return 0; } else if (n % 2 == 0) { return mystery(n / 2); } else { return 1 + mystery(n...

A recurrence arises in the problem: Number of ways to tile a 3×n rectangle with 2×1 dominoes (dominoes can be placed vertically or horizontally). Let T(n)​ be this number...

Consider the following C code:#include<stdio.h int temp = 0; int fun(int x, int y) { int z; temp++; if (y==3) return(x*x*x); else { z=fun(x, y/3); return(z*z*z); } } int ...

Consider the function in $C$ code:Cal(a,b) { if (b!=1) { if (a!=1) { printf("*"); Cal(a/2, b); } else { b=b-1; Cal(10,b); } }}How many times $*$ is going to be printed, i...

Consider the following recursive C function.unsigned int f(unsigned int n) { if (n < 10) printf("%d",n); else { printf("%d", n%10); f(n/10); printf("%d", n%10); } }What d...

What string does the following program print?#include <stdio.h #include <string.h void strFunc2 (char A[], int n) { char t; if (n <= 1) return; t = A[0]; A[0] = A[n-1]; A...

Let the function g be defined as follows:int g ( int n ) { if (n < 2) return n; return g(n/2); }What is the value returned by the call $\mathrm{g}(142857)$ ?$0$ $1$ $2$ $...

Consider the following recursive function definition:function FOO(n) if (n=0) then return 0 else if ( n = 1) then return 1 else if ( n = 2) then return 3 else return n + ...

The next two questions pertain to the following code which takes a non-negative integer as input.function FOO(n) if (n=0) then return 0 else if (n=1) then return 1 else i...

The next two questions pertain to the following code which takes a non-negative integer as input}.function FOO(n) if (n=0) then return 0 else if (n=1) then return 1 else ...

What is the solution to the following recursion?$$\begin{array}{l}T(n)=T\left(\dfrac{n}{2}\right)+T\left(\dfrac{n}{3}\right)+T\left(\dfrac{n}{6}\right)+O(n), \\T(n)=5 \qu...

Suppose the function $f$ is defined by the following pseudocode. What will be printed when $f(5)$ is called?function f(x) { if (x 1) { print(x); f(x-2); print(x); } }$55...

Let f(x) be defined as follows:function f(x){ count := 0; while (x 0) { x := floor(x/2); count := count + 1; } return count; }where floor(y) is defined as the largest in...