Level 3 Level 5
15 words 0 ignored
Ready to learn Ready to review
Check the boxes below to ignore/unignore words, then click save at the bottom. Ignored words will never appear in any learning session.
Picking out the important bits of information.
A step-by-step set of rules or instructions.
Coming up with an algorithm to solve a problem.
binary search algorithm
A searching approach where a list is split in two. The target value is compared to the middle item and the half which cannot contain the target value is discarded. The process is repeated until the target value is found or the list is exhausted.
A sorting approach which repeatedly steps through an unordered list, comparing each pair of adjacent items and swapping them if they are in the wrong order. Causing the larger items to "bubble up" to one end and the smaller items to "sink" to the other.
Tackling a problem through decomposition, abstraction and algorithmic thinking.
Breaking a problem down into smaller problems.
A graphical way of showing an algorithm.
A sorting approach where the next item in an unordered list is placed, or inserted, in it's correct place within an ordered list
linear search algorithm
A searching approach where a target value is compared to each item in a list, one after another, until the target value is found or the end of the list is reached.
A sorting approach where a list is split into individual items, these are then sorted as pairs are combined, or merged, together into ordered lists
The order in which statements are executed in a program (controlled with selection and iteration statements).
A set of instructions in the style of a programming language but using plain English.
A set of instructions that you can follow to find an item in a list.
A set of instructions that you can follow to order a list of items.