Register

reference book

291 views
0 votes
0 votes 
Evaluate the time complexity of following recurrence relation:

    T(x,c) = Θ(x)                         for c<=2
    T(c,x) = Θ(y)                         for c<=2
    T(x,y) = Θ(x+y) + T(x/2,y/2) otherwise
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

0 votes
0 votes
1 answer
1
rexritz asked Aug 30, 2023
203 views
Digital logic reference book doubt
Is Modern Digital Electronics by R.P Jain a good book for preparing digital logic for CSE or should I stick with Morris Mano only? Which book covers gate related content in more depth?
Is Modern Digital Electronics by R.P Jain a good book for preparing digital logic for CSE or should I stick with Morris Mano only? Which book covers gate related content ...
User Avatar
0 votes
0 votes
1 answer
3
ykrishnay asked May 22, 2022
531 views
BEGINNER FRIENDLY BOOK FOR ALGORITHMS ?
I wanted to read ALgorithms by cormen but is it to complex to read for beginners ? or i read from other book ? please tell about the cormen is it easy to read for gate and PSU interviews ?
I wanted to read ALgorithms by cormen but is it to complex to read for beginners ? or i read from other book ?please tell about the cormen is it easy to read for gate and...
User Avatar
–1 votes
–1 votes
0 answers
4
CHïntän ÞäTël asked Nov 19, 2018
797 views
ace book
how to find value in this type of question???
how to find value in this type of question???
User Avatar
Link Copied!