487 views

1 Answer

0 votes
0 votes

Ans:Theta(n2)

Explanation is in the image

Hope this is the answer,Thnak you for your question :)

Related questions

4 votes
4 votes
3 answers
1
1 votes
1 votes
1 answer
2
Markzuck asked Jan 6, 2019
491 views
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?
0 votes
0 votes
1 answer
3
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
4
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^{...