Register

madeeasy

• retagged by
307 views

1 Answer

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

Related questions

1 votes
1 votes
1 answer
1
Markzuck asked Jan 6, 2019
501 views
MadeEasy Test Series: Algorithms - Time Complexity
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
User Avatar
0 votes
0 votes
1 answer
2
Markzuck asked Dec 29, 2018
791 views
MadeEasy Test Series 2019: Algorithms - Time complexity
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c,like cant we take both the recurrance call as combined as both have same parameter?and if not, then ...
User Avatar
2 votes
2 votes
0 answers
4
ashish pal asked Jan 22, 2018
675 views
MadeEasy Test Series 2018: Algorithms - Asymptotic Notations
Let f (n) = Ο(n), g(n) = Ω(n) and h(n) = θ(n). Then g(n) + f(n).h(n) is ______ A.) Ω(n) B.) θ(n2) C.) Ω(n2) D.) θ(n) How to do these type of questions ?
Let f (n) = Ο(n), g(n) = Ω(n) and h(n) = θ(n). Then g(n) + f(n).h(n) is ______A.) Ω(n)B.) θ(n2)C.) Ω(n2)D.) θ(n)How to do these type of questions ?
User Avatar
Link Copied!