binary search
Technical term in computing for a search algorithm that repeatedly divides a sorted list in half.
Binary search is an algorithm that performs fast searches on sorted arrays.
Compound of 二分 (にぶん, 'dividing into two') and 探索 (たんさく, 'search').