Metraipolis › archive › dc_c2cb07960164

Search algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Search_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T00:45:43.058Z
SHA-256 of the archived text
0662c44d6abb326fcc4ab61364c83304deb5fbacdebf26facd8574299ed6d38d
Stable URL of this page
https://metraipolis.com/documento/dc_c2cb07960164

How to cite

Search algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Search_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_c2cb07960164 (Metraipolis archive dc_c2cb07960164, sha256 0662c44d6abb326fcc4ab61364c83304deb5fbacdebf26facd8574299ed6d38d)
BibTeX
@misc{dcc2cb07960164,
  title = {Search algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Search_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_c2cb07960164; sha256 0662c44d6abb326fcc4ab61364c83304deb5fbacdebf26facd8574299ed6d38d},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Search_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, a search algorithm is an algorithm designed to solve a search problem. Search algorithms work to retrieve information stored within a particular data structure, or calculated in the search space of a problem domain, with either discrete or continuous values. Although search engines use search algorithms, they belong to the study of information retrieval, not algorithmics. The appropriate search algorithm to use 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.

Tema degli esploratori: agenti e intelligenza artificiale (deposito sistematico; ricerca «autonomous agent»).
Fonte: Wikipedia in inglese, voce «Search algorithm» — https://en.wikipedia.org/wiki/Search_algorithm
Wikidata Q755673: «algoritmo che permette di trovare un elemento avente determinate caratteristiche all'interno di un insieme di elementi» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q755673
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Search_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1376670198, consultata il 2026-10-05T23:59:30.738Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: cecf4c025b091d3890e2af339b32b1f6d62757c3fdaf5db2caa2f10c63e85ae8