| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Balanced binary search tree | Math | A binary search tree in which at most one node has one child. All other nodes have two or zero children. (references) | |
| Binary search | Computing | Binary search A search algorithm which repeatedly divides an ordered search space in half according to how the required (key) value compares with the middle element. The following pseudo-C routine performs a binary search return the index of the element of vector "thing[first...last]" equal to "target": if (target < thing[first] || target > thing[last]) return NOT_FOUND; while (first < last) thing[mid]) first = mid+1; else return mid;">mid = (first+last)/2; /* truncate to integer */ if (target < thing[mid]) last = mid; else if (target > thing[mid]) first = mid+1; else return mid; if (target == thing[last]) return last; return NOT_FOUND; (1995-04-10). Source: The Free On-line Dictionary of Computing.. | |
| Binary search | Math | Search a sorted array by repeatedly dividing the search interval in half. Begin with an interval covering the whole array. If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half. Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty. (references) | |
| Binary search tree | Math | A binary tree where every node's left subtree has values less than the node's value, and every right subtree has values greater. A new node is added as a leaf. (references) | |
| Height-balanced binary search tree | Math | A height-balanced tree which is also a binary search tree. It supports membership, insert, and delete operations in time logarithmic in the number of nodes in the tree. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
Topics by Level of Interest: BINARY SEARCH | ||||
| Topics sorted by level of Interest | Level (1=low, 600=high) | Topics sorted Alphabetically | Level (1=low, 600=high) | |
| Binary search tree | 55 | Binary search algorithm | 42 | |
| Binary search algorithm | 42 | Binary search tree | 55 | |
| Uniform binary search | 4 | Uniform binary search | 4 | |
Source: the editor, created by/for EVE to gauge likely levels of human interest in linguistically triggered topics (compiled across various sources, such as Wikipedia and specialty expression glosses). | ||||
