Register
Dark Mode

#self doubt

in Algorithms
203 views
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?

in Algorithms
by
203 views

2 Comments

by
Are you understanding the answer given? If yes then please explain. I am not getting the solution
0
0
by
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
2
samarpita asked in Algorithms Dec 29, 2021
646 views
#self doubt
how to solve this?
samarpita asked in Algorithms Dec 29, 2021
by samarpita
646 views
0 votes
0 votes
0 answers
3
Rishabh Baghel asked in Algorithms Apr 27, 2019
146 views
#self doubt
Is it required to focus on space complexity for "GATE"?
Rishabh Baghel asked in Algorithms Apr 27, 2019
by Rishabh Baghel
146 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!