0 votes 0 votes https://gateoverflow.in/258/gate2003-66 if we are using binary search thn it should be O(logn) ,how it is O(log n)^2? himgta asked Sep 21, 2018 himgta 209 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply rajatmyname commented Sep 21, 2018 reply Follow Share Are you understanding the answer given? If yes then please explain. I am not getting the solution 0 votes 0 votes Shaik Masthan commented Jan 29, 2019 reply Follow Share the reason is :- https://gateoverflow.in/258/gate2003-66?show=168672#c168672 0 votes 0 votes Please log in or register to add a comment.