Last Updated：2025/12/01
(computing theory) 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.
音声機能が動作しない場合はこちらをご確認ください
See correct answer
binary search
Edit Histories（0）
Source Word
binary search
Noun
countable
uncountable
Japanese Meaning
整列済みの配列から目的の値を効率的に探し出すアルゴリズム。対象値と中央の要素を比較し、存在し得ない半分を除外して探索を続ける方法。
（ plural ）
