Register

MadeEasy Test Series: Algorithms - Time Complexity

• edited by
782 views

1 Answer

0 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. 

Voting & Accepting an answer helps improve the community
Answer:
← Previous · # stacksNext → · #doubt
← Previous in category · MadeEasy Test Series...Next in category → · Divide and conquer
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.6k
1.6k views
Markzuck asked Dec 29, 2018
1,625 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 ...
1 1 vote
0 0 answers
1.6k
1.6k views
Ayush Upadhyaya asked Jul 14, 2018
1,557 views
Algorithms-Time Complexity
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 2 votes
1 answers 1 answer
1.6k
1.6k views
gauravkc asked Apr 5, 2018
1,603 views
Algorithms time Complexity
What is the time complexity of this code?What is the time complexity of the following code?for (int $\mathrm{i}=\mathbf{1} ; \mathrm{i}0 ; \mathrm{h}=\mathrm{h} / 2$ )sum...
0 0 votes
1 1 answer
837
837 views
Naveen Pandey asked Jan 8, 2017
837 views
Algorithms: Finding time complexity
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?