Data Structures and Algorithms The Complete Masterclass - Binary Search Complexity

What is the primary advantage of binary search over linear search?

• It can handle unsorted arrays.

• It is easier to implement.

• It reduces the search space by half each time.

• It requires less memory.

How does binary search determine the next step in the search process?

• By checking each element sequentially.

• By comparing the middle element to the target.

• By sorting the array first.

• By using a hash table.

In a binary search, what is the time complexity in the worst-case scenario?

• O(n)

• O(n^2)

• O(log n)

• O(1)

What is the best-case time complexity for binary search?

• O(1)

• O(n^2)

• O(log n)

• O(n)

Why is binary search more efficient than linear search for large datasets?

• It can skip elements that are not needed.

• It only works on sorted arrays.

• It uses less computational power.

• It has a constant time complexity.