Catatan: Terjemahan untuk entri ini sedang dalam peninjauan kualitas, sehingga sebagian konten untuk sementara hanya ditampilkan dalam bahasa Inggris.
Entri ini belum diterjemahkan ke bahasa Anda, sehingga versi aslinya ditampilkan di bawah.
binary search
This term is a technical compound noun used primarily in computer science and mathematics. It describes a specific algorithmic strategy characterized by logarithmic time complexity, which makes it significantly faster than a linear search for large datasets.
Crucially, the term implies a prerequisite: the data must be sorted. Using a binary search on an unsorted list is a common logical error in programming, as the algorithm relies on the sorted nature of the data to determine which half of the interval to discard.