A means of defining an algorithm using shapes and arrows
Back
Card 7
Front
Used to mark the start and end of a flowchart
Back
Card 8
Front
Asks a question in a flowchart and each arrow leaving the shape must have one possible answer to the question written alongside it
Back
Card 9
Front
The part of a flowchart that contains a single instruction
Back
Card 10
Front
When instructions in an algorithm need to be executed only once and in the order they are written
Back
Card 11
Front
When one sequence of instructions but not another is executed
Back
Card 12
Front
When one or more instructions is executed more than once. Can also be known as repetition.
Back
Card 13
Front
Putting data into an order (e.g numerical, alphabetical chronological, ascending, descending)
Back
Card 14
Front
A search algorithm that begins at one end of a data structure, checking each data item in turn until the required item is found or the end of the structure is reached
Back
Card 15
Front
A search algorithm that begins in the middle of a data structure, eliminating half of the data with each pass. Only appropriate when data has already been sorted
