Algorithm

.1.1 Understand what an algorithm is, what algorithms are used for and be able to interpret algorithms [flowcharts, pseudocode, structured English, written descriptions, program code]*

Demonstrate it and say what it is.

1.1.2 Be able to create an algorithm to solve a particular problem, making use of programming constructs [sequence, selection, repetition] and using an appropriate notation [flowchart, written description, program code]

Demonstrate it and say what it is.

1.1.3 Be able to describe the purpose of a given algorithm and explain how a simple algorithm works

Demonstrate it and say what it is.

1.1.4 Be able to identify the correct output of an algorithm for a given set of data

Demonstrate it and say what it is.

1.1.5 Be able to identify and correct errors in algorithms

Demonstrate it and say what it is.

1.1.6 Be able to code an algorithm into a high-level language

Demonstrate it and say what it is.

1.1.7 Understand how the choice of algorithm is influenced by the data structure and data values that need to be manipulated

Demonstrate it and say what it is.

1.1.8 Understand how standard algorithms [quick sort, bubble sort, selection sort, linear search, binary search, breadth first search, depth first search, maximum/minimum, mean, count] work

Demonstrate it and say what it is.

1.1.9 Understand factors that affect the efficiency of an algorithm

Demonstrate it and say what it is.

1.2.1 Be able to analyse a problem, investigate requirements [inputs, outputs, processing, initialisation] and design solutions

Demonstrate it and say what it is.

1.2.2 Be able to decompose a problem into smaller sub-proble

Demonstrate it and say what it is.