Binary search

Related Terms:

sort middle element eliminate avl tree value unequal array

Noun

Definition: A search for a value within a sorted array by repeatedly comparing the target value with the middle element; if they are unequal, the half in which the target cannot lie is eliminated and the comparison is repeated on the remaining half.

We hope you enjoyed looking up some related words and definitions. We use various open machine learning and human sources to provide a more coherent reference that pure AI can provide. Although there are similar sites out there, they are filled with nonsense and gibberish due to their pure machine learning approach. Our dataset is in part derived from ConceptNet and WordNet with our own sprinkle of magic. We're always working on improving the data and adding more sources. Thanks for checking us out!