The document discusses properties of binary search, highlighting that it is a divide-and-conquer algorithm that requires a sorted list as input. It runs in O(log n) time, contrary to the incorrect claims of O(n) or O(1) times, and it does not require a hash table.

1. Problem 5. Binary Search Q2. Select all properties of a binary search. is a divide-and-conquer
algorithm requires a sorted list as input runs in O(n) times runs in O(1) times runs in O(logn)
times requires a hash table