#108 Binary Search

What type of search was used to find 27?

• Breadth-first search
• Linear search
• Binary search
• Depth-first search

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

• It's easier to implement

•  It's faster for large datasets

• It works on unsorted arrays

• It uses less memory

In the worst case scenario, how many steps would binary search take to find a number in an array of 1 million elements?

• 1 million

• 100,000

• 10,000

• 20

Which of the following is NOT a requirement for using binary search?

• The collection must be sorted

• The data structure must allow random access

• The elements must be numbers

• You must be able to jump to any index in constant time

 Why might linear search be preferred over binary search in some situations?

• Linear search is always faster

• Binary search requires more memory

• If you only need to search the data once, sorting for binary search may take longer overall

• Linear search works on any data type

What types of data can binary search be used with?

•  Only integers

•  Numbers and strings

• Any type that can be compared and ordered

• Only sorted arrays