1 votes 1 votes Algorithms array test-series + – ben10 asked Aug 29, 2018 • retagged Aug 29, 2018 by Sayan Bose ben10 558 views answer comment Share Follow See all 10 Comments See all 10 10 Comments reply MiNiPanda commented Aug 29, 2018 reply Follow Share Is it A? 0 votes 0 votes Shaik Masthan commented Aug 29, 2018 reply Follow Share https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/ 1 votes 1 votes Shaik Masthan commented Aug 29, 2018 reply Follow Share 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 votes 0 votes ben10 commented Aug 29, 2018 reply Follow Share Given answer is D. 0 votes 0 votes srestha commented Aug 29, 2018 reply Follow Share @Shaik https://gateoverflow.in/1507/gate1999-8 this question, rt? 0 votes 0 votes Shaik Masthan commented Aug 29, 2018 reply Follow Share 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 votes 0 votes Swapnil Naik commented Aug 30, 2018 reply Follow Share @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 votes 0 votes Shaik Masthan commented Aug 30, 2018 reply Follow Share @Swapnil Naik may be answer provided by the test series wrong... 0 votes 0 votes ben10 commented Aug 30, 2018 reply Follow Share No exp, they just say D 0 votes 0 votes Dharmendra Lodhi commented Sep 1, 2018 reply Follow Share A will be correct answer because A has lower time complexity.we can solve in O(n*m) in simple search. 0 votes 0 votes Please log in or register to add a comment.