binary search meaning in English
对半检索
对分查找
对分检索
对分搜索，折半查找
二分查找
二分搜寻法
二元搜寻
折半查找法
折半检索
Examples
- Add and remove operations are typically expensive since binary search trees require that a tree be balanced
通常需要增加和删除操作，因为二叉树需要被平衡。 - Simple binary tree class - binary search trees are useful for finding items in a list that changes infrequently
二叉搜索树在查找经常变化的列表时是很非常有用的。 - This method performs a binary search ; however , the elements are moved up to fill in the open spot , so this method is an o
此方法执行二进制搜索，但会上移元素以填充空白区域，因此，此方法的运算复杂度为o ( - The split of search space can be described as a virtue binary search tree and the info - search process is similar to the search in the binary tree
在此基础上，信息的搜索就可描述为二进制搜索树的查找过程。 - Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。