D1 Algorithms

From KS5 Mathematics
Revision as of 08:48, 18 June 2014 by IDI (talk | contribs) (Objectives)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Part of D1

Objectives

  • Idea of an algorithm and implementation by flowchart
  • Bin packing (first fit, first fit decreasing, full bin)
  • Bubble sort
  • Quick sort
  • Binary search


Preparation

Supporting activities

Consolidation

Homework

Key questions

Assessment

Notes