D1

Front 1

Bubble Sort Algorithm

Back 1

Orders words or numbers

Compare adjacent items, for each pair of values:

1. If in order, leave them.

2. If not in order swap them.

Continue until you go through lists and there are NO swaps.

Front 2

Quick Sort Algorithm

Back 2

Quick and efficient

Select a pivot and split items into 2 sublists: those less than pivot + greater than pivot. Leave in same order.Binary

Front 3

Binary Search Algorithm

Back 3

Searches ordered list to find whether a particular item is in list.

QUICK: concentrates on midpoint of ever halving list.

1. Select middle item M and see if target T before or after M, discard part of list T not in.

2. Continue till T found.

Front 4

Binpacking

Back 4

Way of sorting items into containers

Front 5

First-fit

Back 5

1. Take items in order given.

2. Place each item in first available bin that can take it.

N.B Start from bin 1 each time

Front 6

First-fit decreasing

Back 6

1. Reorder items into descending order.

2. Apply first-fit algorithm to descending list.

Front 7

Full-bin Packing

Back 7

1. Use observation to find combinations of items that will fill a bin - pack these first.

2. Pack remaining using first-fit algorithm.

Front 8

Lower Bound (binpacking)

Back 8

Gives number of bins needed at least.

Add size of each item + divide by bin size.

N.B Always round up ^^

Front 9

Vertex Set

Back 9

List of vertices

Front 10

Edge Set

Back 10

List of edges

Front 11

Subgraph

Back 11

Part of original graph

Front 12

Vertices/Nodes

Back 12

Points on graph

Front 13

Edges/Arcs

Back 13

Lines connecting points

Front 14

Weighted graph/network

Back 14

When number associated with each edge

Front 15

Degree/Valency/Order

Back 15

No. edges incident on vertex