Search Algorithm Recap

How does a binary search algorithm work?

• by randomly selecting elements from the search space until the target element is found or the search space is empty.

• by comparing each element in the search space with the target element until a match is found or the search space is empty.

• by repeatedly dividing the search space in half until the target element is found or the search space is empty.

• by comparing the last element of the list first and then moving towards the desired element

How does a linear search algorithm work?

• by randomly selecting elements from the search space until the target element is found or the search space is empty.

• by comparing each element in the search space with the target element until a match is found or the search space is empty.

• by repeatedly dividing the search space in half until the target element is found or the search space is empty.

• by comparing the last element of the list first and then moving towards the desired element

When should you use a linear search algorithm instead of a binary search algorithm?

• When the list is sorted.

• When the list contains duplicate elements.

• When the list is very large.

• When the list is not sorted.

What is a binary search algorithm used for?

• A binary search algorithm is used to sort an array in ascending order.

• A binary search algorithm is used to find the position of a target value within a sorted array.

• A binary search algorithm is used to randomly select elements from a list or array.

• A binary search algorithm is used to compare each element in a list or array with the target value.

When should you use a binary search algorithm instead of a linear search algorithm?

• When the list is sorted.

• When the list contains duplicate elements.

• When the list is very large.

• When the list is not sorted.

In python we implement an array with a:

• variable

• list

• dictionary

• string