# Algorithms Time complexity

170 views

1
200?
0
112 ??
1

@Magma inside we have two loops which have O(n+logn)...

and 2 outside loop runs for O(n)

so overall = 0(n(n+logn)) = O(n2) ?

.

check once ! i have cross checked maybe i missed somewhere...

0
Yeah you're right

I did silly mistake :p
0
What's the answer ? 200 ?

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

0

## Related questions

1
188 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?
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.