953 views
0 votes
0 votes

 

1 Answer

0 votes
0 votes

I am getting 100 :( for Bound=1 loop is running 1*(n+logn) times, for Bound=2 its running 2*(n+logn) times and so on ..

So, the series i am getting is n+2n+4n+8n+... which comes out to be O(n).

kindly correct me if something wrong @srestha@Arjun@Habibkhan

Related questions

1 votes
1 votes
1 answer
1
Markzuck asked Jan 6, 2019
501 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
791 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
3
Ayush Upadhyaya asked Jul 14, 2018
714 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
4
gauravkc asked Apr 5, 2018
897 views
What is the time complexity of this code?