0 votes 0 votes O(n) O(Log n) O(Log log n) none Algorithms algorithms recurrence-relation asymptotic-notation test-series + – gate_forum asked Jan 13, 2019 • retagged Jul 13, 2022 by makhdoom ghaya gate_forum 497 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Kunal Kadian commented Jan 13, 2019 reply Follow Share The answer is C. O(log log n) And this question is duplicate. Please check. 0 votes 0 votes Kunal Kadian commented Jan 13, 2019 reply Follow Share Refer this link:- https://gateoverflow.in/287095/uppcl-2018-ae And close this duplicate question. 0 votes 0 votes gate_forum commented Jan 14, 2019 reply Follow Share Can u please explain?? 0 votes 0 votes Satbir commented Jan 14, 2019 reply Follow Share https://gateoverflow.in/282096/please-help-me-stuck-for-a-long-time this will help. 0 votes 0 votes Please log in or register to add a comment.
–1 votes –1 votes answer is c. spike500 answered Jan 14, 2019 spike500 comment Share Follow See all 0 reply Please log in or register to add a comment.
