2.3.1(f) Binary Search

What is binary search used for?

• Calculating the sum of all elements in an array

• Finding a target value in an unsorted array

• Sorting an array in ascending order

• Finding a target value in a sorted array

How does binary search reduce the search area?

• By eliminating one value at a time

• By eliminating one third of the remaining values

• By randomly selecting a new search area

• By eliminating half of the remaining values

What is the initial step in a binary search algorithm?

• Selecting the leftmost value of the array

• Selecting the rightmost value of the array

• Sorting the array

• Finding the middle value of the array

What happens if the value at mid is greater than the target?

• The search continues with values less than mid

• The search continues with values greater than mid

• The algorithm restarts from the beginning

• The algorithm returns the mid index

What is the time complexity of binary search?

• O(n)

• O(n log n)

• O(log n)

• O(1)

What does the binary search algorithm return if the target is not found?

• -1

• The index of the closest value

• The last index searched

• 0

How is the 'mid' index calculated in binary search?

• By averaging the left and right indices and rounding up

• By averaging the left and right indices and rounding down

• By selecting the leftmost index

• By selecting the rightmost index