binary chop - перевод на русский
Diclib.com
Словарь онлайн

binary chop - перевод на русский

SEARCH ALGORITHM IN SORTED LISTS THAT OPERATES BY DECREASING THE SEARCH SPACE BY HALF EACH PASS
Binary chop; Binary search; Bsearch; Binary Search; Half-interval search; Half-interval search method; Half interval search method
  • Binary search can be adapted to compute approximate matches. In the example above, the rank, predecessor, successor, and nearest neighbor are shown for the target value <math>5</math>, which is not in the array.
  • binary-search
  • The worst case is reached when the search reaches the deepest level of the tree, while the best case is reached when the target value is the middle element.
  • tree]] representing binary search. The array being searched here is <math>[20, 30, 40, 50, 80, 90, 100]</math>, and the target value is <math>40</math>.
  • [[Binary search tree]]s are searched using an algorithm similar to binary search.
  • Visualization of [[exponential search]]ing finding the upper bound for the subsequent binary search
  • In [[fractional cascading]], each array has pointers to every second element of another array, so only one binary search has to be performed to search all the arrays.
  • Visualization of [[interpolation search]] using linear interpolation. In this case, no searching is needed because the estimate of the target's location within the array is correct. Other implementations may specify another function for estimating the target's location.
  • In noisy binary search, there is a certain probability that a comparison is incorrect.
  • [[Uniform binary search]] stores the difference between the current and the two next possible middle elements instead of specific bounds.

binary chop         

[bainəri'tʃɔp]

вычислительная техника

двоичный поиск

поиск делением пополам

binary search         

общая лексика

двоичный поиск

алгоритм поиска, заключающийся в том, что пространство поиска (search space) каждый раз делится пополам, после чего производится сравнение с элементом из середины выбранной половины и, таким образом, пространство поиска каждый раз уменьшается вдвое, в списке из миллиона элементов двоичный поиск может потребовать максимум 20 шагов

синоним

dichotomizing search

Смотрите также

backward search; exhaustive search; full text search; linear search; search

binary search         
(dichotomizing search) поиск делением пополам, двоичный поиск

Определение

binary search
<algorithm> 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) { mid = (first+last)/2; /* truncate to integer */ if (target == thing[mid]) return mid; if (target < thing[mid]) last = mid-1; else first = mid+1; } if (target == thing[last]) return last; return NOT_FOUND; (2003-01-14)

Википедия

Binary search algorithm

In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value, and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array.

Binary search runs in logarithmic time in the worst case, making O ( log n ) {\displaystyle O(\log n)} comparisons, where n {\displaystyle n} is the number of elements in the array. Binary search is faster than linear search except for small arrays. However, the array must be sorted first to be able to apply binary search. There are specialized data structures designed for fast searching, such as hash tables, that can be searched more efficiently than binary search. However, binary search can be used to solve a wider range of problems, such as finding the next-smallest or next-largest element in the array relative to the target even if it is absent from the array.

There are numerous variations of binary search. In particular, fractional cascading speeds up binary searches for the same value in multiple arrays. Fractional cascading efficiently solves a number of search problems in computational geometry and in numerous other fields. Exponential search extends binary search to unbounded lists. The binary search tree and B-tree data structures are based on binary search.