2.1 Algorithms
- Created by: GoddessOfLondon
- Created on: 30-03-18 13:12
H | E | A | I | O | M | F | G | J | T | N | G | H | Q | A | E | B | T | H | X | C |
V | C | L | K | F | L | O | W | C | H | A | R | T | U | L | Y | J | T | G | Q | A |
Q | H | G | E | F | M | V | V | A | W | E | N | H | M | Y | E | X | D | V | Q | N |
A | C | O | Q | S | L | V | V | C | A | B | S | T | R | A | C | T | I | O | N | U |
L | R | R | W | V | G | B | H | K | W | K | X | O | D | Y | E | T | S | R | T | P |
G | A | I | A | G | S | C | T | V | G | F | Y | J | A | P | L | S | T | O | G | O |
O | E | T | N | G | P | N | K | Y | R | Y | S | T | I | N | I | P | P | T | R | J |
R | S | H | G | P | W | N | R | B | P | M | E | H | Q | H | O | T | D | A | H | I |
I | R | M | G | E | E | Q | Y | I | I | T | L | Q | X | M | F | X | E | N | S | Q |
T | A | I | E | K | D | R | L | N | V | O | E | M | P | T | H | Q | C | I | M | D |
H | E | C | D | G | O | O | E | A | Q | B | C | U | O | J | Q | Q | O | M | X | M |
M | N | T | K | M | C | L | P | R | Q | M | T | D | C | E | Q | U | M | R | C | I |
A | I | H | C | F | O | S | I | Y | O | U | I | X | C | V | L | W | P | E | A | E |
J | L | I | F | D | D | P | I | S | E | F | O | S | E | L | F | M | O | T | E | Y |
N | R | N | O | Y | U | D | E | E | N | N | N | F | U | T | O | A | S | Y | E | M |
K | V | K | I | T | E | D | U | A | R | C | V | E | O | D | T | I | I | Y | W | H |
X | P | I | P | N | S | O | S | R | U | T | N | H | V | I | F | F | T | D | M | J |
E | B | N | L | U | P | D | M | C | Y | U | H | X | W | K | N | L | I | W | A | K |
R | E | G | E | X | D | N | V | H | F | H | X | Q | B | D | H | G | O | J | K | F |
E | K | B | D | X | I | V | G | L | T | T | L | W | E | H | X | H | N | W | K | C |
T | U | M | D | U | U | W | N | L | B | P | F | E | L | B | L | T | T | T | Y | B |
Clues
- A cross between English and a generic-looking programming language (10)
- A means of defining an algorithm using shapes and arrows (9)
- 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 (6, 6)
- 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 (6, 6)
- A series of instructions that describes how to solve a specific problem (9)
- Breaking down a problem into smaller 'sub-problems' (13)
- Hiding the layers of complexity within a system, in order to focus on one specific layer of complexity (11)
- Reaching a solution using a systematic approach, as opposed to jumping straight to the solution (11, 8)
- Used to mark the start and end of a flowchart (10)
- When one sequence of instructions but not another is executed (9)
Comments
No comments have yet been made