in Algorithms
304 views
0 votes
0 votes

in Algorithms
304 views

4 Comments

@MiNipanda,Could you please work out your steps?
0
0
https://gateoverflow.in/231844/time-complexity#c232038
 See my first comment..here only the difference is in the k loop..there it was logn here it will be logn(logn) because for each iteration logn time required to compute n/2 which earlier was taking constant time.
Also if you find something wrong there so point it out..
2
2
@MiniPanda,Thanks. :)
0
0

Please log in or register to answer this question.

Related questions