Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.

Answers were Sorted based on User's Feedback



Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / akbar

binary search is faster than linear search.

Is This Answer Correct ?    3 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / guest

A Binary search of an ordered set of elemaents in an array

Is This Answer Correct ?    2 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / ibna

binary search

Is This Answer Correct ?    2 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / angu

Binary Search is efficent and faster because in Binary
search we search in systematic way which helps to fetch the
data easy. where as in Sequential search we have to come
across tll the nodes to get the desired data.

Is This Answer Correct ?    5 Yes 4 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / siya

binary search...............

Is This Answer Correct ?    0 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / binita

binary search is faster
as the root has the value greater then left subtree & less
then right subtree so sorting is easier

Is This Answer Correct ?    0 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / rohini c

Binnary search tree complexity is log n where as linear search terr complexity is 'n'so it is quite clear from complexity that Binnary tree is faster than sequential search or linear search........complexity means rate of execution time.

Is This Answer Correct ?    0 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / uma sankar reddy.p

Binarysearch is faster than sequential search

Is This Answer Correct ?    0 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / p.divya poojitha

binary search is faster than sequential searching.in
sequential searching the desired record is 4000 if u search
that record can be done with 1....4000 so it takes large
time for searching compare complexities of both searching
meathods are
binary search O(logn)
sequential search O(n)

Is This Answer Correct ?    0 Yes 0 No

Which one is faster? A binary search of an orderd set of elements in an array or a sequential s..

Answer / priyank

Binary search tree..:)

Is This Answer Correct ?    0 Yes 1 No

Post New Answer

More Data Structures Interview Questions

What is the main advantage of a linked list?

0 Answers  


How to get a list of tables, views and columns in firebird database?

0 Answers  


Why do we use dynamic arrays?

0 Answers  


Mention some drawbacks of the linked list.

0 Answers  


Which is the parent class of linkedlist class?

0 Answers  


Explain Queue

0 Answers   Tech Mahindra,


What is application of data structure?

0 Answers  


What is binary search in programming?

0 Answers  


What does adt stands for?

0 Answers  


How dynamic arrays are created?

0 Answers  


Is boolean a data type?

0 Answers  


On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.

0 Answers   Aspiring Minds,


Categories