Register

doubt

• edited by
202 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
0 answers
1
Aakanchha asked Jan 8, 2018
836 views
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
9 votes
1 answer
2
anoop yadav 2 asked Jan 8, 2018
13,499 views
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
5 votes
5 votes
1 answer
3
resuscitate asked Jan 12, 2016
1,183 views
Ds..
Consider the following function: void f(int a) { if(a <= 0) return ; else{ printf("%d ",a); f(a-2); printf("%d ",a); f(a-3); } } The sum of all values printed by f(6) is _____ .
Consider the following function:void f(int a) { if(a <= 0) return ; else{ printf("%d ",a); f(a-2); printf("%d ",a); f(a-3); } }The sum of all values printed by f(6) is __...
User Avatar
0 votes
0 votes
4 answers
4
Aryanzzzz asked Jan 16, 2023
477 views
Self Doubt
A recursion program without a terminating condition will provide infinite output. True/False?
A recursion program without a terminating condition will provide infinite output. True/False?
User Avatar
Link Copied!