Virtual Labs

What is the primary requirement for Binary Search to work?

The array must be unsorted
The array must be sorted
The array must contain duplicate values
The array must be small

What is the best-case time complexity of Binary Search?

O(1)
O(n)
O(n²)
O(log n)

What happens during each step of Binary Search?

The array is divided into halves
Adjacent elements are swapped
The target element is always moved
Duplicate elements are removed

Which dataset is most suitable for Binary Search?

Large unsorted datasets
Large sorted datasets
Small unsorted datasets
Floating-point datasets

What is the average-case time complexity of Binary Search?

O(1)
O(n)
O(log n)
O(n²)

Binary Search Posttest