Answers.com > Wiki Answers > Categories > Technology > Computers > What are the short comings of a binary search methods and sequential search methods?

What are the short comings of a binary search methods and sequential search methods?

In: Computers, C Programming [Edit categories]

Answer:

When the list is small the sequential search is faster than a binary search. With a large list the binary search wins the race.

A binary search requires the list to be in sort order, a sequential search does not.

A sequential search is a brute force method.
A binary search is a divide and conquer method.

First answer by Lnr729. Last edit by Lnr729. Contributor trust: 7 [recommend contributor ]. Question popularity: 1 [recommend question].

[report abuse]

Can you answer these Computers questions?

	How do you make a picture dictionary for mobiles?	Answer it!
	Can you play a UMD disk in a PC drive?	Answer it!
	What is computer principles?	Answer it!
	How much gold is in a ton of computer part?	Answer it!
	How can technology have positive and negative effects on society?	Answer it!

Relevant answers:

What is binary search and sequential search?
A Binary Search is a technique for quickly locating an item in a sequential list. A Sequential Search is a procedure for searching a table that consists of starting at some table position (usually...
What is binary search method?
Binary search method is a method to search a specific data from a large volume of data.In this method ,data at the middle is checked ,if it is found search is completed otherwise that half is...
What are search methods?
Search Methods:1. Directory2. Subject Director3. Meta search4. indivdual
What are four search methods?
--Google --Yahoo--Dictionary--Facebook
Why is binary search faster than sequential search?
In sequential search, you have to check each element in the list one after another, with a worst case efficiency of O(n). If you use binary search the list must be sorted), you are essentially...