ricerca dicotomica
Also known as half-interval search, logarithmic search, binary chop
algoritmo di ricerca
AI overview
Binary search is a method for finding a specific item in a sorted list by repeatedly dividing the search area in half, eliminating half of the remaining possibilities with each step. It matters because this approach is much faster than checking every item one by one, especially when dealing with large lists.
AI-generated from the Wikipedia summary — may contain errors.
Key facts
- Class
- Search algorithm
- Data structure
- Array
- Worst case performance
- O (log n )
- Best case performance
- O (1)
- Average performance
- O (log n )
- Worst case space complexity
- O (1)
- Optimal
- Yes
via Wikipedia infobox
Article · Italiano
In informatica, la ricerca dicotomica (o ricerca binaria) è un algoritmo di ricerca che individua l'indice di un determinato valore presente in un insieme ordinato di dati. La ricerca dicotomica richiede un accesso casuale ai dati in cui cercare.
Abstract from DBpedia / Wikipedia · CC BY-SA