edited by
491 views

1 Answer

0 votes
0 votes

Best way of doing such question is 

way 1-take log on both the sides and then compare functions

way 2- take a very large value like 10^30 and then check the value of the functions. 

Answer:

Related questions

0 votes
0 votes
1 answer
1
Markzuck asked Dec 29, 2018
775 views
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 ...
1 votes
1 votes
0 answers
2
Ayush Upadhyaya asked Jul 14, 2018
682 views
What is the time complexity of the below code?for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$){ $k=k^5;$ $k=k-10$}My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{...
2 votes
2 votes
1 answer
3
gauravkc asked Apr 5, 2018
855 views
What is the time complexity of this code?
0 votes
0 votes
1 answer
4
Naveen Pandey asked Jan 8, 2017
487 views
T(n)=2T(log n)+c c is a constant. Base condition is if(n<2) return 1What will be the tightest bound on time complexity?