Algorithms Time complexity

Question

 

Comments

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

 

---

Yeah you're right

I did silly mistake :p

---

What's the answer ? 200 ?

Answer 1

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

Comments

this onehttps://csedoubts.gateoverflow.in/13955/made-easy-mock-2