+1 vote
116 views

retagged | 116 views
0
Is it A?
+1
0
Already this is discussed in GO, But none of them explanations doesn't satisfies me,

Come to the point,

The recurrence relation i got is

T(m,n) = $T(\frac{m}{2},n) + T(m,\frac{n}{2}) + 1$ ====> This can be solved by Tree method but i am not able to solve it.

and i observe that, it is following Pascal triangle, i mean

1          1

1         2           1

1        3            3              1

1        4            6         4                 1
0
Given answer is D.
0

@Shaik

https://gateoverflow.in/1507/gate1999-8

this question, rt?

0
yes mam, i found it on morning.... but didn't read, and it is also not generalize in view of time complexity.. i need to work on that
0
@Shaik Masthan

That geeks for geeks link says answer is O(N + M) but @ben10 says the given answer is D. What is the correct the answer? According to me A should be correct.

@ben10 can you provide solution/reference for you answer?
0

@Swapnil Naik

may be answer provided by the test series wrong...

0
No exp, they just say D
0
A will be correct answer because A has lower time complexity.we can solve in O(n*m) in simple search.

0 votes
0 answers
1
+1 vote
0 answers
2
+1 vote
0 answers
3
0 votes
0 answers
4