Recent questions tagged recursion

Consider the following function:What is the cost in time in the worst case as a function of $n$ of mystery $(m, n)?$. Assume $m>0, n 0$.$\theta(\log n)$$\theta(n \log n)...

What will be the output of following program?Assume that all necessary libraries are included.void myfunction(char *s, char *t) { int i = 0, n = 0; char p; n ...

Consider a following recursive function $\textsf{f()}.$#include<stdio.h int f(int *a, int n) { if(n <= 0) return 0; if(*a % 2 == 0) return *a + f(a+1, n-1...

#include <stdio.h int fun(int num) { while(num>0) { num=num*fun(num-1); } return num; } int main() { int x=fun(8); printf("%d",x); ret...

Consider the following pair of mutually recursive functions.int f(int n){ if (n==0) return 1; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) - f(...

What will be the number of recursive calls for $\textsf{mystery(5)}$ including the first call?void mystery(int n) { if (n == 0 || n == 1) return 0; mystery(n-2); printf("...

What will be the output of the following program?#include<stdio.h struct _go{ char b[20]; char *a; struct _go *c; }x = {"GATE", "2023", x+1, "GO", "Classes", x}, *p = x;...

Consider the following recursive function which is used by dynamic programming. T(n) = { 0; if n<1 1; if n=1 T(n-1)+T(n-2)+1; if n>1}Assume ...

Which of the following methods can be used to solve the Knapsack problem?Brute force algorithm RecursionDynamic programmingBrute force, Recursion, and Dynamic Programming

Consider the following $\text{C}$ function :int f(int n) { static int i = 1; if (n = 5) return n; n=n + i;i++; return f(n); }The value returned by $\text{f}(1)$ is :$5$$...

#include<stdio.h int test(int *a, int *b) { int c = *a-*b; if (c<0) return 0; else return (1 + test(&c, b)); } void main() { int x = 15; int y = 4; int a = test(&x,&y); p...