Decision 1 Algorithms

HideShow resource information
Bubble Sort
Look down the list and make a comparison, and if necessary a swap. Repeat this until no more swaps are needed. (Does not apply if there is only one number in list).
1 of 8
Shuttle Sort
Look at the first two numbers in the list during the 1st pass and swap if necessary. On the second pass only look at the 3rd number and continue swapping the number until no longer necessary. On the third pass look at the 4th number only and so on.
2 of 8
First-Fit Algorithm
Look at each number and place it in the first available space and continue until all numbers have been used up.
3 of 8
Prim's Algorithm
Used to find minimum spanning tree. Select any node as 1st node and pick arc with min weight. Continue drawing arcs until all nodes have been covered.
4 of 8
Kruskal's Algorithm
Used to find minimum spanning tree. Choose arc with least weight. Choose next arc with least weight as long as it doesn't form a cycle. Continue until there are 1 less arcs than nodes.
5 of 8
Dijkstra's Algorithm
Used to find shortest path (each node is labelled with a box). Start at node and look at each possible path labelling the nodes with the lowest weight (temporary label and later a permanent label. Repeat steps until destination has a permanent label.
6 of 8
Chinese Postman Algorithm
Used to create a eulerian graph. Find all nodes with an odd order and find a way off connecting the nodes using the lowest weight and draw a new arc to signify. Once completed, find a route containing all nodes in the graph.
7 of 8
Nearest Neighbour Algorithm
Choose any starting node and pick the arc with the least weight to arrive at the next node. The arc with the least weight from the new node is picked. This step is repeated until all nodes have been visited and then an arc is drawn to the first node.
8 of 8

Other cards in this set

Card 2

Front

Look at the first two numbers in the list during the 1st pass and swap if necessary. On the second pass only look at the 3rd number and continue swapping the number until no longer necessary. On the third pass look at the 4th number only and so on.

Back

Shuttle Sort

Card 3

Front

Look at each number and place it in the first available space and continue until all numbers have been used up.

Back

Preview of the back of card 3

Card 4

Front

Used to find minimum spanning tree. Select any node as 1st node and pick arc with min weight. Continue drawing arcs until all nodes have been covered.

Back

Preview of the back of card 4

Card 5

Front

Used to find minimum spanning tree. Choose arc with least weight. Choose next arc with least weight as long as it doesn't form a cycle. Continue until there are 1 less arcs than nodes.

Back

Preview of the back of card 5
View more cards

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »