2.1 Algorithms

Define what is meant by the term 'algorithm'

• Step by step instructions to solve a problem.

• Code for a specific task.

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

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

Describe an advantage of a linear search algorithm

• Data does not need to be in order.
• Performs well over large ordered lists.
• Can only work on an ordered list.  If unordered must use a linear search.
• Slow with large data sets.

Describe a disadvantage of a linear search algorithm

• Data does not need to be in order.
• Performs well over large ordered lists.
• Can only work on an ordered list.  If unordered must use a linear search.
• Slow with large data sets.

Describe an advantage of a binary search algorithm

• Data does not need to be in order.
• Performs well over large ordered lists.
• Can only work on an ordered list.  If unordered must use a linear search.
• Slow with large data sets.

Describe a disadvantage of a binary search algorithm

• Data does not need to be in order.
• Performs well over large ordered lists.
• Can only work on an ordered list.  If unordered must use a linear search.
• Slow with large data sets.

Decomposition is used to:

• Create programs using pre-made code.

• Follow the logic in a program.

• Break down problems into smaller ones.

• Find errors in the code.

Algorithms are used to:

• Provide simple instructions to solve a problem.

• Help you cook with a Raspberry Pi.

• Visualise the structure of a program.

• Find errors in your code.