2.1 Algorithms

Breaking down a problem into manageable steps and developing into an algorithm to solve with.

Filtering out the characteristics of a problem that are not needed in order to concentrate on those that are needed.

Breaking down a large problem into smaller sub-problems.

Identifying the steps involved in solving a problem.

Each item in the list is checked and parsed through in order.

An ordered list is divided into two parts with each comparison.

Moving through a list repeatedly , swapping elements that are in the wrong order.

A list is splint into smaller lists (2 elements ) and then are combined and ordered.

A collection of data with a single identifier.

Each item takes it turns , compare to the items in a sorted list and placed in the correct position.

The series of steps to solve a problem or perform an action.

A diagram that shows the inputs, outputs and processes in an algorithm.

An action that takes place .

Simplified programming code that is not language specific , used to design algorithms.

A table that follows the values of a variable to check for accuracy.

Rectangle = An action

Rectangle + bars

Parallelogram

Diamond

Oval = start/stop

• Syntax • Logic

code written does not follow the grammatical and format rules of the programming language

error in the way a program works

• set the counter to middle pos of list • value = match means the search ends • if midpoint value is < value , list split in 2 and bottom half ignored -if midpoint value > value , list split in 2 and top half ignored • Repeat until value is found