Register

LCS problem

• retagged by
479 views

1 Answer

0 votes
0 votes

option D is correct because if we make the tree of lcs function calling level of Right  sub tree is m level and left  sub tree is n level than total will be (m+n) .. so that (m+n) will be function call  of this program

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

Related questions

1 votes
1 votes
2 answers
1
Nitesh_Yadav asked Apr 11, 2022
275 views
Test Series
What is the time complexity of the below mentioned recursive function. int f(n) { if(n!=1) { return f(n/2)+f(n/2); } else return 10; } O(n) O(n^2) O(log n) O(n logn)
What is the time complexity of the below mentioned recursive function.int f(n){ if(n!=1){ return f(n/2)+f(n/2);}elsereturn 10;} O(n)O(n^2)O(log n)O(n logn)
User Avatar
1 votes
1 votes
1 answer
2
Aditya Bahuguna asked Jan 7, 2018
2,504 views
binary search space complexity
User Avatar
0 votes
0 votes
3 answers
3
shikharV asked Nov 17, 2015
2,082 views
Finding Time complexity
Given answer: B Please explain
Given answer: BPlease explain
User Avatar
1 votes
1 votes
1 answer
4
shikharV asked Nov 15, 2015
1,029 views
Finding time complexity of Dynamic programming problem
The answer to the above problem is A but I am expecting it to be D as constant amount of work is required to solve each subproblem.
The answer to the above problem is A but I am expecting it to be D as constant amount of work is required to solve each subproblem.
User Avatar
Link Copied!