Register

Recent questions tagged recursion

0 votes
2 answers
91
GeeksForGeeks
Find time complexity of below Program? A(n){ if(n<=1) return; else return $A(\sqrt{n})$ ; }
Find time complexity of below Program?A(n){if(n<=1) return;elsereturn $A(\sqrt{n})$ ;}
User Avatar
2 votes
1 answer
92
gate forum
User Avatar
1 votes
2 answers
93
pseudo code
int zap(int n) { if (n<=1) then zap =1; else zap = zap(n-3)+zap(n-1); } then the call zap(6) gives the values of zap Give the proper explanation
int zap(int n){if (n<=1) then zap =1;else zap = zap(n-3)+zap(n-1);}then the call zap(6) gives the values of zapGive the proper explanation
User Avatar
0 votes
0 answers
94
recursion"what is the output of the program"
#include <stdio.h> void fun(int); typedef int (*pf) (int ,int ); int proc(pf, int ,int); int main() { int a = 3; fun(a); return 0; } void fun(int n) { if (n>0) { fun(--n); printf("%d,", n); fun(--n); } }
#include <stdio.h>void fun(int);typedef int (*pf) (int ,int );int proc(pf, int ,int);int main(){ int a = 3; fun(a); return 0; }void fun(int n){ if (n>0) ...
User Avatar
3 votes
3 answers
96
geeksforgeeks
#include <stdio.h> int main() { static int i=5; if(--i) { main(); printf("%d ",i); } }
#include <stdio.h int main() { static int i=5; if( i) { main(); printf("%d ",i); } }
User Avatar
2 votes
2 answers
97
Recursion
int f (int n){ if (n==0) return 0; if(n==1) return 1; else return f(n-1)+f(n-2); } Find the upper bound and lower bound to the number of function calls for input size 'n'?
int f (int n){ if (n==0) return 0; if(n==1) return 1;elsereturn f(n-1)+f(n-2);}Find the upper bound and lower bound to the number of function ...
User Avatar
1 votes
1 answer
98
Recursion
void ab() { auto int a; static int s= 5; a = ++s; printf("%d%d",a,s); if(a<= 7) ab(); printf("%d%d",a,s); } void main() { ab(); } According to me answer should be- 667788887766 but the answer is - 667788887868. Please explain
void ab() { auto int a; static int s= 5; a = ++s; printf("%d%d",a,s); if(a<= 7) ab(); printf("%d%d",a,s); } void main() { ab(); }According to me answer should be- 6677888...
User Avatar
2 votes
2 answers
100
data structure
To remove recursion from a program we have to use which of the following data structure? array stack queue list
To remove recursion from a program we have to use which of the following data structure?arraystackqueuelist
User Avatar
1 votes
0 answers
101
Time Complexity
What will be the time complexity of the following algorithm ? A(n){ if(n<=1) return 1; for(i=1;i<n;i++){ for(j=0;j<3;j++){ A(n-1) } } }
What will be the time complexity of the following algorithm ?A(n){if(n<=1) return 1;for(i=1;i<n;i++){ for(j=0;j<3;j++){ A(n-1) } }}
User Avatar
1 votes
0 answers
102
GATE Suitability Test | Test 1 | Question: 11
Consider the following C program? void mystery(int n){ if(n<=0) return; printf("%d", 0); mystery(n-1); mystery(n-2); } int main(){ int n=10; mystery(n); return 0; } The number of ‘0’s printed by above program is ?
Consider the following C program?void mystery(int n){ if(n<=0) return; printf("%d", 0); mystery(n-1); mystery(n-2); } int main(){ int n=10; mystery(n); return 0; }The num...
User Avatar
7 votes
3 answers
103
Time complexity , Recursion
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
User Avatar
0 votes
0 answers
105
Recursion Tree
What is the max height of recursion tree of recurrence $c(100,50)$? here, the recursive function is defined as $c(n,k) = c(n-1,k-1) + c(n,k-1)$ terminating condition $c(n,n) = 1, c(n,0) = 1$.
What is the max height of recursion tree of recurrence $c(100,50)$?here, the recursive function is defined as$c(n,k) = c(n-1,k-1) + c(n,k-1)$terminating condition$c(n,n) ...
User Avatar
0 votes
1 answer
107
SAnfoundary
What data structure would you most likely see in a non-recursive implementation of a recursive algorithm? Linked List Stack Queue Tree please explain also
What data structure would you most likely see in a non-recursive implementation of a recursive algorithm?Linked ListStack QueueTreeplease explain also
User Avatar
0 votes
1 answer
111
recursion
did recursion is bottom up approach to problem solving?
did recursion is bottom up approach to problem solving?
User Avatar
5 votes
0 answers
114
Time Complexity
T(n) $\leq$ T($\frac{n}{5}$) + T($\frac{7n}{10}$) + 15n T(n) $\leq$ 5 when n $<$ 6
T(n) $\leq$ T($\frac{n}{5}$) + T($\frac{7n}{10}$) + 15nT(n) $\leq$ 5 when n $<$ 6
User Avatar
4 votes
0 answers
115
Recurrence equation
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\left ( \frac{n}{2} \right ) +n^{2}2^{\frac{1}{2}}$
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\lef...
User Avatar
9 votes
1 answer
116
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
How to solve above recurrence relation (With substitution method)??
User Avatar
2 votes
0 answers
119
Recursion
State which one is true 1) Every left recursive grammar can be converted to right recursive grammar 2) Every right recursive grammar can be converted to left recursive grammar 3) Recursion use static storage
State which one is true1) Every left recursive grammar can be converted to right recursive grammar2) Every right recursive grammar can be converted to left recursive gram...
User Avatar
3 votes
1 answer
120
C Recursion
User Avatar
Page: