Algorithm

If the data is in order the best search to use would be a

• Binary Search
• Linear Search

What is Decomposition?

• •– the use of computers to solve problems.
• representing 'real world' problems in a computer using variables and symbols and removing unnecessary elements from the problem
• •breaking down a large problem into smaller sub-problems.
• •identifying the steps involved in solving a problem.

'The worst case scenario is you have to check all the values' is a disadvantage for a 

• Linear Search
• Binary Search

'The algorithm is longer and more complex to write' is a disadvantage for a 

• Binary Search
• Linear Search

Linear Search is faster than Binary search

• TRUE
• FALSE
• It depends on the scenario

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

How many binary searches will it take to find the value 10 in the list [1,4,9,10,11]?

• 0
• 1
• 2
• 3

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

A Linear search algorithm requires data to be ordered.

• True
• False