Register

self doubt algo

277 views
0 votes
0 votes

https://gateoverflow.in/43600/gate1992-07b

how can we sovle recurrence relation if recurence relation not exists ??

we can compute the value and tym complexity??

User Avatar

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

1 votes
1 votes
0 answers
1
srestha asked May 19, 2019
640 views
Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
User Avatar
0 votes
0 votes
0 answers
2
eyeamgj asked Aug 30, 2018
196 views
SELF DOUBT ALGO
https://gateoverflow.in/27194/tifr2014-b-9 CAN ANY ONE GIVE AN EXAMPLE BY TAKING SOME ELEMENTS SAY 14 ELEMENTS AND PLEASE SHOW HOW 2ND AND 3RD MINIMUM ARE RETRIEVING USING TREE METHOD.
https://gateoverflow.in/27194/tifr2014-b-9CAN ANY ONE GIVE AN EXAMPLE BY TAKING SOME ELEMENTS SAY 14 ELEMENTS AND PLEASE SHOW HOW 2ND AND 3RD MINIMUM ARE RETRIEVING USING...
User Avatar
0 votes
0 votes
1 answer
3
eyeamgj asked Jun 24, 2018
410 views
algo self doubt
consider the following c program A(n) { if(n<=1) return(n2 +n+1) else return(5A(n/2)+3A(n/2)+MA(n)) } where MA(n) has complexity O(n2). 1.what is the recurrence relation for value.? 2.what is the the recurrence relation for time complexity?
consider the following c program A(n){if(n<=1)return(n2 +n+1)elsereturn(5A(n/2)+3A(n/2)+MA(n))}where MA(n) has complexity O(n2).1.what is the recurrence relation for valu...
User Avatar
Link Copied!