What are the advantages and disadvantages of binary search algorithms?

Answer 1

the major limitation of binary search is that there is a need of sorted array to perform binary search operation.

if array is not sorted the output is either not correct or may be after a long number of steps and according to data structure the output should come in minimum number of steps.

Answer 2

The disadvantage of binary search in any language is that you must provide an ordered list, usually an array, for the algorithm to search. Arrays are either static in size or, if dynamic, require special processing when they grow in size. A linked list does not work, because you need to make random access to the elements. The more generalized solution of a dynamic binary search is a binary tree, instead of a linked list, but trees also have special processing requirements and, in order to maintain O=LogN processing time, must have provision for being maintained in a balanced state. Its all a matter of tradeoff...

Answer 3

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.

Answer 4

The primary advantage of a binary search algorithm is that searching a sequence can be achieved in logarithmic time. The primary disadvantages are that the data must be in sorted order. Arrays are the ideal container for binary searches as they provide constant-time random-access and are therefore trivial to both sort and search efficiently. Sorted binary trees can also be used, however for optimal performance they must be totally balanced (e.g., red/black binary tree). Constant-time random-access is not a requirement of binary trees, however the cost of maintaining balance during construction of the tree has to be taken into account.

With a linear search, we start at one end of the sequence and traverse through the sequence one element at a time until we find the value we're looking for, or we reach the element one-past-the-end of the sequence (in which case the element we're looking for does not exist). For a sequence of n elements, the worst case is O(n). Linear search is ideal for forward lists (singly-linked lists) and lists (doubly-linked lists) as neither provides nor requires constant-time random-access.

With binary search, we locate the middle element in the sequence. If that's not the value we are looking for, we can easily determine which half of the sequence contains our value because the elements are in sorted order. So we eliminate the other half and repeat the algorithm with the remaining half. As such, each failure to find the value reduces the number of elements to be searched by half (plus the middle element). If there are no elements in the remaining half then the value does not exist. The worst case is therefore O(log n).

Answer 5

The only real disadvantage of binary search is that we must adjust the tree every time a new node is inserted or an existing node is removed in order to maintain balance. A sorted array provides the best binary search performance at the expense of increased insertion and extraction times.

Answer 6

the list should be sorted. if not try using linear list. the list should be sorted. if not try using linear list.

Answer 7

the binary code is in the form of 0's and 1's so it can be detected and hacked by others . if the binary code will be some different the hacker cannot identify it

Answer 8

no answer