A ________ search works by repeatedly dividing the portion of the array that could contain the item until you've narrowed down the possible locations to just one.
- Binary
- Depth-First
- Hash
- Linear
A 'Binary' search works by repeatedly dividing the portion of the array that could contain the item until you've narrowed down the possible locations to just one. It's an efficient search algorithm for sorted arrays.
Loading...
Related Quiz
- What does a nested structure in C allow you to do?
- The function ________ is used to write data to a binary file.
- What is the default starting value of an enumeration in C?
- In a two-dimensional array declared as int arr[5][10];, the expression arr[i][j] refers to the ________ element in memory.
- In C++, what happens when two overloaded functions have the same number and types of parameters but differ in return type?