Fundamentals of Algorithms

Algorithm

A sequence of steps followed to complete a task.

Decomposition

Breaking a large problem into smaller problems to make it easier to understand.

Abstraction

Process of removing unnecessary detail from a problem.

Pseudocode

A method of writing up a set of instructions for a computer program using plain English.

Flowchart

A diagram which shows a step by step process of an algorithm.

Input

Data or information which is put into the program.

Output

Data or information which the program makes.

Trace Table

A table which shows how the values of variables change as the program executes.

Efficiency

Managing to carry out a task whilst making the least possible use of resources.

Time Efficiency

How much time is taken for an algorithm to complete a particular task.

Search

Finding a value or piece of information within a set of data.

Linear Search

Searching through a list of items, checking them one by one until it's found.

Binary Search

Searching through an ordered list by looking at the middle item in the list, comparing it to the target value, and repeating the process until the value is found.

Sort

A way of placing information into a certain order, such as alphabetically or by number.

Merge Sort

A way of sorting a list by dividing it into two pairs until each item is separated individually, then comparing and ordering them.

Bubble Sort

A way of sorting a list by comparing items two at a time, changing order if needed, and repeating until correct order is achieved.