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.
If the data is sorted and every element is directly accessible, then you can perform binary search (see built-in function bsearch), otherwise you have to do linear search (which is slower).
Binary search requires that the list be in search key order.
A binary search is much faster.
(i) Binary search can interact poorly with the memory hierarchy (i.e. caching), because of its random-access nature. For in-memory searching, if the interval to be searching is small, a linear search may have superior performance simply because it exhibits better locality of reference. (ii) Binary search algorithm employs recursive approach and this approach requires more stack space. (iii) Programming binary search algorithm is very difficult and error prone (Kruse, 1999).
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
There are a few disadvantages of the Fibonacci search: It can be slower than other search algorithms if the data is not sorted. It can be less accurate than other search algorithms if the data is not sorted. It can be more difficult to implement than other search algorithms.
If the data is sorted and every element is directly accessible, then you can perform binary search (see built-in function bsearch), otherwise you have to do linear search (which is slower).
both seach has different algorithem but the complexity will be same...
there are many advantages and disadvantages so i do not have time to tell you search anywhere else OHK?
paul and anj
To ensure efficient balancing of a binary search tree, one can use self-balancing algorithms like AVL trees or Red-Black trees. These algorithms automatically adjust the tree structure during insertions and deletions to maintain balance, which helps in achieving optimal search and insertion times.
The advantages of search engines are that they give information required by a person. The disadvantage is that it cannot see or feel that for what is that information required.
blekko merits and demerits
Advantages:BST is fast in insertion and deletion etc when balanced.Very efficient and its code is easier than link lists.Disadvantages:Shape of the tree depends upon order of insertion and it can be degenerated.Searching takes long time.
Some examples of efficient algorithms used in data processing and analysis include sorting algorithms like quicksort and mergesort, searching algorithms like binary search, and machine learning algorithms like k-means clustering and decision trees. These algorithms help process and analyze large amounts of data quickly and accurately.
Advantages of using bidirectional A search algorithm in pathfinding include faster search times and more efficient use of resources. Disadvantages may include increased complexity in implementation and potential for higher memory usage.
try these search results http://www.google.com/search?q=advantages+and+disadvantages+to+sole+proprietorship&ie=utf-8&oe=utf-8&aq=t&rls=org.mozilla:en-US:official&client=firefox-a