Difference between revisions of "D1 Algorithms"
(Created page with "Part of D1 == Objectives == <onlyinclude> * </onlyinclude> == Preparation == == Supporting activities == == Consolidation == == Homework == == Key questions == == Assessme...") |
(→Objectives) |
||
| Line 2: | Line 2: | ||
== Objectives == | == Objectives == | ||
<onlyinclude> | <onlyinclude> | ||
| − | * | + | *Idea of an algorithm and implementation by flowchart |
| + | *Bin packing (first fit, first fit decreasing, full bin) | ||
| + | *Bubble sort | ||
| + | *Quick sort | ||
| + | *Binary search | ||
</onlyinclude> | </onlyinclude> | ||
| + | |||
== Preparation == | == Preparation == | ||
== Supporting activities == | == Supporting activities == | ||
Latest revision as of 08:48, 18 June 2014
Part of D1
Contents
Objectives
- Idea of an algorithm and implementation by flowchart
- Bin packing (first fit, first fit decreasing, full bin)
- Bubble sort
- Quick sort
- Binary search
