The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Linked list
0
votes
205
views
Why linked list not suitable for binary search?
binarysearch
asked
Apr 4, 2016
in
DS
by
Anjali Raghu
(
25
points)

205
views
Facebook
Google+
Twitter
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
2
Answers
+2
votes
Best answer
There is no way to index the elements in the linked list which makes it unsuitable for binary search.
answered
Apr 4, 2016
by
srivivek95
Active
(
1.6k
points)
selected
Jun 5, 2016
by
Desert_Warrior
comment
We use binary search to reduce the search complexity to $O(\log n)$ but in a linked list to find the middle element itself takes $O(n)$.
Thanku
Please
log in
or
register
to add a comment.
+1
vote
Because nodes of linked list may or may not be present in the continuous memory location, so we can only use linear search while array occupies continuous memory location, so a binary search is possible.
answered
Apr 16, 2016
by
Nikhil Chaudhary
(
35
points)
comment
Please
log in
or
register
to add a comment.
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+2
votes
1
answer
1
Linked List
Linked Lists are not suitable for _____. A. Binary Search B. Polynomial Manipulation C. Insertion D. Radix Sort
asked
Jun 16, 2016
in
DS
by
im.raj
Active
(
1.5k
points)

1.9k
views
linkedlists
binarysearch
+8
votes
3
answers
2
Modified Binary Search
Suppose the first step in binary search algorithm is changed to M = (9L+R)/10, we know that the complexity of binary search is log(n). What will be the complexity of modified search? a) log(n) b) n c) n$\log 9/10(n)$ d) 2nlog(n)
asked
Aug 16
in
DS
by
Chandramani Adil
(
191
points)

327
views
modifiedbinarysearch
binarysearch
+2
votes
3
answers
3
Binary Tree
What is the difference between Binary Tree and Almost complete Binary tree and complete Binary Tree and full Binary Tree and Binary search Tree and Balanaced Binary Search Tree. Diagram would be appriciated otherwaise write 23 basic difference .
asked
Jul 16, 2016
in
DS
by
Don't you worry
Active
(
1.9k
points)

369
views
binarytree
binarysearch
datastructure
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
Recent Posts
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
All categories
General Aptitude
1.1k
Engineering Mathematics
4k
Digital Logic
1.7k
Programming & DS
2.9k
Programming
2.1k
DS
838
Algorithms
2.6k
Theory of Computation
3.2k
Compiler Design
1.2k
Operating System
2.3k
Databases
2.3k
CO & Architecture
2.1k
Computer Networks
2.4k
Non GATE
795
Others
1.2k
Admissions
244
Exam Queries
419
Tier 1 Placement Questions
16
Job Queries
40
Projects
4
Follow @csegate
Gatecse
Recent Blog Comments
I got mail today for ISRO exam.
OK @
@Chhotu Yes important but don't believe or ...
In d link mentioned below. Yeah. :)
I followed the exact same routine! just for a ...
29,017
questions
36,844
answers
91,378
comments
34,721
users