A linear search does not need your data set to be ______.

When is a linear search a good algorithm to use?

• If your data set is very large

• If your data set is sorted in order

• If your data set is small

• If your data set is made up of irrational numbers

When would you get a best case scenario for a linear search?

• When your data set is small

• When your data set is large

• When your search item is near the beginning of the list

• When the search item is in the middle of the list

When would you get the best case scenario for a binary search?

• When your list is small

• When your list is unsorted

• When your search item is in the beginning of the list

• When your search item is exactly in the middle of the list

Which of these statements is true for binary search?

• It looks at each data item in order sequentially

• It is very good if your data set is very small

• It requires your data set to be sorted

• It only works if your data set is made out of 0s and 1s

Which of these is a disadvantage of linear search?

• It does not work on unsorted data sets

• It is very inefficient on large data sets

• It is very time consuming on small data sets

• It requires twice as much memory as binary search

What is the worst case scenario for a linear search?

• When the data set is large and your search item is in the middle of the list

• When the data set is small and the search item is at the beginning of the list

• When the data set is made up of curved geometric shapes

  -OWEN D

• When the data set is large and the search item is at the end of the list

Linear search will work on ________ lists.

Which of these is true for binary search algorithms

• It can be used to traverse a binary tree graph

• It works only on sorted data

• It is efficient for large data sets

• It is a divide and conquer algorithm

Linear search algorithm

• is inefficient on large data sets

• can be used on unsorted data

• Requires the data set to be already sorted

• Does not work quadratic equations