Question 3
When using the binary search algorithm on a sorted list, consider the maximum number of comparisons it might take in the worst-case scenario to find an item or confirm it's absent. If the total number of items in this sorted list is doubled, how does this maximum number of comparisons change?
It doubles
It remains the same
It becomes half
It increases by 1