723 views
1 votes
1 votes
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^{10}))$

Please verify.

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Markzuck asked Jan 6, 2019
507 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
2
Markzuck asked Dec 29, 2018
803 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 ...
2 votes
2 votes
1 answer
3
gauravkc asked Apr 5, 2018
912 views
What is the time complexity of this code?
0 votes
0 votes
1 answer
4
Naveen Pandey asked Jan 8, 2017
505 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?