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.
Add your answer
Loading...

Leave a comment

Your email address will not be published. Required fields are marked *