Best Answer

The question is a bit too vague for a meaningful answer, it depends on what you are searching and what you are looking for.

For search in an unsorted list, there is no better alternative than the naive algorithm of looking at every single element.

For search in a sorted list (like a phone book sorted on name) binary search is much more efficient.

For string search, like used in Biology to find DNA matches, there are dedicated algorithms that deal exclusively with string matching.

For graph search, A* ("A star") is among the better.

For more general search problems there are a whole host of search methods that work better than others in particular domains. But so far, there is no ultimate winner that is best for everything. The best ones are generally custom made for one particular problem, like the best known algorithm for the Travelling Salesman Problem.

See also related link.

More answers

It is the process to finding to location of the given data elements in the data structure

linear and binary searching techniques

binary search

Q: Which search algorithm is best

Write your answer...

Submit

Still have questions?

Continue Learning about Engineering

Binary Search Algorithm

To search a particular element from the vector, use the find() algorithm. If the vector is sorted, you can use the binary_search() algorithm to improve efficiency. Both algorithms can be found in the <algorithm> header in the C++ standard library.

dijkstra's algorithm (note* there are different kinds of dijkstra's implementation) and growth graph algorithm

By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.

One of the best property of an algorithm is that it is simple. It can not be too long and ambiguous, it has to be straightforward, with understandable variables as used also in a pseudocode.

Related questions

The linear search algorithm is a special case of the brute force search.

Binary Search Algorithm

Best-first.

These are terms given to the various scenarios which can be encountered by an algorithm. The best case scenario for an algorithm is the arrangement of data for which this algorithm performs best. Take a binary search for example. The best case scenario for this search is that the target value is at the very center of the data you're searching. So the best case time complexity for this would be O(1). The worst case scenario, on the other hand, describes the absolute worst set of input for a given algorithm. Let's look at a quicksort, which can perform terribly if you always choose the smallest or largest element of a sublist for the pivot value. This will cause quicksort to degenerate to O(n2). Discounting the best and worst cases, we usually want to look at the average performance of an algorithm. These are the cases for which the algorithm performs "normally."

You can use a The Depth-First Search algorithm.

The Google algorithm is a set of rules that the search engine uses to determine which websites are ranked higher than others in its search results. The specifications for this algorithm are secret, and changes to it happen frequently. As a result, there is no way to know exactly how any given search will be ranked.

To search a particular element from the vector, use the find() algorithm. If the vector is sorted, you can use the binary_search() algorithm to improve efficiency. Both algorithms can be found in the <algorithm> header in the C++ standard library.

The linear search algorithm is a special case of the brute force search.

searchValue

bisection algorithm (see link)Euclid's algorithm (see link)Fibonacci search (see link)

SEO algorithm partially uses keywords to determine page rankings. The best way to rank for specific keywords is by doing SEO. SEO essentially is a way to tell Google that a website or web page is about a particular topic.

i want to know how to give the algorithm password in a computer ?