Quiz Complete, well Done!
Binary Search can be used to find the closest value to a target value in a
array.
What is the key difference between binary search and linear search?
What is Binary Search?
Space complexity
Leaf
Sorted array
Balanced binary search tree
Binary Search only works on
data.
What is the benefit of using binary search over linear search?
What is the purpose of a binary search?
The time complexity of Binary Search is
.
What data structure is typically used for binary search?
Iteration
Mid-point
The number of iterations in Binary Search is at most
In Binary Search, search interval is repeatedly
in half.
Comparison
Pre-order traversal
Binary Search is an example of a
algorithm.
Binary Search can be implemented both iteratively and
.
