Linear vs Binary Search

Which type of lists or data sets are linear searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

Which type of lists or data sets are binary searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

Select the best description to explain what a linear search algorithm is.

• Put the elements in order, check each item in turn.
• Put the elements in order, compare with the middle value, split the list in order and repeat.
• Elements do not need to be in order, check each item in turn.
• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

Select the best description to explain what a binary search algorithm is.

• Put the elements in order, check each item in turn.

• Put the elements in order, compare with the middle value, split the list in order and repeat.

• Elements do not need to be in order, check each item in turn.

• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

A linear search is to be performed on the list:
12   6   8  1  3
How many comparisons would it take to find number 1?

• 1
• 2
• 3
• 4

Where can Linear Search / Binary Search be performed?

• On letters
• On numbers
• Both
• None of these

On average, which searching algorithm is more efficient?

• Binary Search
• Linear Search

How many linear searches will it take to find the value 7 in the list [1,4,8,7,10,28]?

• 2
• 3
• 4
• 5

Linear Search is faster than Binary search. This may be true for smaller lists.

• TRUE
• FALSE
• It depends on the scenario

What is an advantage of the Linear search algorithm?

• Performs well with small sized data sets
• Can be used on data sets with more than a million elements
• Is complicated to code