MEI Decision 1
- Created by: Caraa
- Created on: 22-05-13 15:59
View mindmap
- Decision 1
- Algorithms
- Sorting
- Shuttle sort
- Bubble sort
- Quick sort
- Bin packing
- First fit decreasing
- First fit
- Full bin
- Key terms
- The conditions for an algorithm are that it must be finite
- Algorithms start with an input
- Algorithms achieve something/ have an end result
- The order of an algorithm is the highest power of n in the function an tells you how fast it is
- Sorting
- Graphs
- Types
- A tree has no cycles
- A simple graph has no loops and at most 1 arc connecting two vertices
- A complete graph is one where every pair of vertices is connected by 1 arc
- A planar graph can be drawn so no arcs cross
- Algorithms
- Dijkstra's
- Prim's
- Kruskal's
- Types
- Networks
- Critical path analysis
- Linear programming
- Simulation
- Algorithms
Comments
No comments have yet been made