answersLogoWhite

0


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.

User Avatar

Wiki User

15y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

12y ago

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

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

linear and binary searching techniques

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

binary search

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: Which search algorithm is best?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the best search algorithm to use for a sorted array?

The best search algorithm to use for a sorted array is the binary search algorithm.


What is the best search algorithm to use for an unsorted array?

The best search algorithm to use for an unsorted array is linear search. It involves checking each element in the array one by one until the desired element is found. This algorithm has a time complexity of O(n), where n is the number of elements in the array.


What is search algorithm?

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


Which search algorithm requires that the arrays contents be sorted?

Binary Search Algorithm


What is the most efficient way to search for a solution in a graph or tree structure using the best-first search algorithm?

The most efficient way to search for a solution in a graph or tree structure using the best-first search algorithm is to prioritize nodes based on a heuristic function that estimates the likelihood of a node leading to the goal. This allows the algorithm to explore promising paths first, potentially leading to a quicker discovery of the solution.


Among best and breadth first search which algorithm has the property that if a wrong path is selected it can be corrected afterwards?

Best-first.


What is the difference between best worst and average case complexity of an algorithm?

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."


What is the complexity of the algorithm in terms of time and space when the keyword "algorithm" is used in a search?

The complexity of the algorithm in terms of time and space when the keyword "algorithm" is used in A search is typically O(bd), where b is the branching factor and d is the depth of the solution. This means that the time and space required by the algorithm grows exponentially with the depth of the solution and the branching factor of the search tree.


An algorithm to find whether a directed graph is connected or not?

You can use a The Depth-First Search algorithm.


what is the google algorithm and specifications?

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.


What is the impact of DFS runtime on the efficiency of algorithm execution?

The runtime of Depth-First Search (DFS) can impact the efficiency of algorithm execution by affecting the speed at which the algorithm explores and traverses the search space. A longer runtime for DFS can lead to slower execution of the algorithm, potentially increasing the overall time complexity of the algorithm.


What is the time complexity of an algorithm that utilizes a binary search algorithm to search through a sorted array, where the search time is represented by the function log(n) in terms of the input size n?

The time complexity of an algorithm that uses a binary search on a sorted array is O(log n), where n is the size of the input array.