Binary and Linear Search

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

• Binary Search
• Linear Search

Check the first value −
IF it is the value you are looking for oCelebrate and stop −
ELSE move to and check the next value REPEAT UNTIL you have checked all the elements and not found the value you are looking for

• Binary
• Linear

IF it is the value you are looking for.
−Celebrate, and stop.
ELSEIF it is larger than the one you are looking for.
   −Take the values to the left of the middle value.
IF it is smaller than the one you are looking for. −Take the values to the right of the middle value.

• Binary
• Linear

What is Abstraction?

• •– 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.

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.

Which of the following is NOT a computational thinking technique?

• Decomposition
• Abstraction
• Coding

Breaking a complex problem down into smaller problems and solving each one individually.

• Decomposition
• Abstraction
• Programming
• Algorithmic Thinking

'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