Is it A?

The Gateway to Computer Science Excellence

+1 vote

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

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

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

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,391 answers

198,591 comments

105,442 users