Key Definitions - 2.1

A set of instructions that are all in order to complete a task

Thinking critically and logically when solving a problem. Being able to analytically solve a problem.

Breaking down a complex problem into smaller problems so it is more manageable to solve

Removing the unnecessary parts of a program so that you only focus on the necessary parts

A type of algorithm used to search through a data set to find a specific piece of data

A type of searching algorithm. The data set must be in order

A type of searching algorithm where the data set doesn’t need to be in order

A type of algorithm used to sort a data set into a specific order.

A type of algorithm used to sort a data set into a specific order. The data set is passed through, and two pieces of data are looked at in turn. The process does not stop until a pass is completed without moving any data.

A type of algorithm used to sort a data set into a specific order. The data set is broken up into pairs. Each pair is reorganised in turn. Pairs are then merged together and reorganised. This process is repeated until the whole data set is merged and reorganised.

A type of algorithm used to sort a data set into a specific order. A new, temporary list is created, and each piece of data is placed into the correct place in the new list.

A midpoint between programming syntax and written language. It is not syntax specific therefore can easily be converted to programming code in any language.

A way of representing algorithms using shapes. All shapes connect up creating a flow

Used to stop and start

Used to give an instruction

Asks a yes/no question

Used to show input/output within a flow diagram

Created as a separate flow diagram, which is then called in the main flow diagram

Used to test an algorithm for logic errors by simulating the flow of execution