Search algorithm
In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. algorithms are Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics.
- Comment
- enIn computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. algorithms are Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics.
- Depiction
- Edition
- 2
- Has abstract
- enIn computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. algorithms are Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm often depends on the data structure being searched, and may also include prior knowledge about the data. Search algorithms can be made faster or more efficient by specially constructed database structures, such as search trees, hash maps, and database indexes. Search algorithms can be classified based on their mechanism of searching into three types of algorithms: linear, binary, and hashing. Linear search algorithms check every record for the one associated with a target key in a linear fashion. Binary, or half-interval, searches repeatedly target the center of the search structure and divide the search space in half. Comparison search algorithms improve on linear searching by successively eliminating records based on comparisons of the keys until the target record is found, and can be applied on data structures with a defined order. Digital search algorithms work based on the properties of digits in data structures by using numerical keys. Finally, hashing directly maps keys to records based on a hash function. Algorithms are often evaluated by their computational complexity, or maximum theoretical run time. Binary search functions, for example, have a maximum complexity of O(log n), or logarithmic time. In simple terms, the maximum number of operations needed to find the search target is a logarithmic function of the size of the search space.
- Hypernym
- Algorithm
- Is primary topic of
- Search algorithm
- Label
- enSearch algorithm
- Link from a Wikipage to another Wikipage
- A* search algorithm
- Algorithm
- Alpha–beta pruning
- Array data structure
- Artificial intelligence
- Backgammon
- Backtracking
- Best-first search
- Binary search algorithm
- Boyer–Moore string search algorithm
- Branch and bound
- Breadth-first search
- Brute-force search
- Category:Internet search algorithms
- Category:Ranking functions
- Category:Search algorithms
- Chemical reaction
- Chess
- Combinatorial game theory
- Combinatorial optimization
- Combinatorial search
- Completeness (logic)
- Computational complexity
- Computer science
- Constraint satisfaction
- Constraint satisfaction problem
- Continuous or discrete variable
- Crossword puzzle
- Cryptography
- Database
- Database index
- Data structure
- Depth-first search
- Dijkstra's algorithm
- Discrete mathematics
- Discrete optimization
- Equation
- Factorization
- Feasible region
- Fibonacci search technique
- File:Hash table 3 1 1 0 1 0 0 SP.svg
- Finance
- Game theory
- Game tree
- Genetic programming
- Glossary of graph theory
- Gradient descent
- Graph traversal
- Group (mathematics)
- Grover's algorithm
- Hash function
- Hash map
- Hash table
- Heuristic function
- Inequation
- Information retrieval
- Jack Kiefer (statistician)
- Knapsack problem
- Knuth–Morris–Pratt algorithm
- Kruskal's algorithm
- Linear search
- List (abstract data type)
- List of algorithms
- Local consistency
- Local search (optimization)
- Map coloring problem
- Marketing
- Metaheuristic
- Military
- Minimax
- Minmax
- Nearest neighbour algorithm
- Nurse scheduling problem
- Path (graph theory)
- Prim's algorithm
- Pruning (decision trees)
- Quantum computing
- Robot
- Search engine (computing)
- Search engine optimization
- Search problem
- Search tree
- Shortest path problem
- Simulated annealing
- Statistics
- Stochastic optimization
- String (computer science)
- String searching algorithm
- Sudoku
- Suffix tree
- Tabu search
- Tree (graph theory)
- Tree traversal
- Vehicle routing problem
- Vertex (graph theory)
- Wikiversity
- Wikiversity:Uninformed Search Project
- SameAs
- 4vmAR
- Algorisme de cerca
- Algorithme de recherche
- Algorithmo de recerca
- Algoritma pencarian
- Algoritmo de busca
- Algoritmo de búsqueda
- Algoritmo di ricerca
- Arama algoritması
- Axtarış alqoritmləri
- Giải thuật tìm kiếm
- Hakualgoritmi
- Keresőalgoritmus
- m.06 xd
- Q755673
- Search algorithm
- Search algorithm
- Suchverfahren
- Søgealgoritme
- Zoekalgoritme
- Αλγόριθμος αναζήτησης
- Алгоритми претраживања
- Алгоритм пошуку
- Алгоритъм за търсене
- Ինֆորմացիոն փնտրում
- חיפוש (אלגוריתם)
- الگوریتم جستجو
- خوارزمية بحث
- অনুসন্ধান অ্যালগোরিদম
- ขั้นตอนวิธีการค้นหา
- 探索
- 搜索算法
- 검색 알고리즘
- SeeAlso
- Solver
- Subject
- Category:Internet search algorithms
- Category:Ranking functions
- Category:Search algorithms
- Thumbnail
- Volume
- 3
- WasDerivedFrom
- Search algorithm?oldid=1124623343&ns=0
- WikiPageLength
- 12820
- Wikipage page ID
- 28249
- Wikipage revision ID
- 1124623343
- WikiPageUsesTemplate
- Template:Algorithmic paradigms
- Template:Annotated link
- Template:Cite journal
- Template:Full citation needed
- Template:Main
- Template:Math
- Template:More citations needed
- Template:Multiple issues
- Template:Refbegin
- Template:Refend
- Template:Reflist
- Template:See also
- Template:Sfn
- Template:Short description
- Template:Specific
- Template:TAOCP
