D1.1 - Algorithms

The general ideas of algorithms and The order of an algorithm is not expected. the implementation of an algorithm given by a flow chart or text.; Whenever finding the middle item of any list, the method defined in the glossary must be used.

Use algorithms and flow-chart implementation to connect the rule to the data and decision in the question.

This matters because algorithms and flow-chart implementation determines what can be inferred or chosen; begin with the stated conditions and keep the conclusion tied to the evidence.

Example: apply algorithms and flow-chart implementation to one small, clearly defined case, show the key step or comparison, and explain the result in words.

Boundary: Algorithms and flow-chart implementation is not a universal recommendation. Check the syllabus scope, assumptions, units and the limits of the evidence before generalising.

Students should be familiar with When using the quick sort algorithm, the pivot should be bin packing, bubble sort, quick sort, chosen as the middle item of the list. binary search.

Use bin packing, sorting and binary search to connect the rule to the data and decision in the question.

This matters because bin packing, sorting and binary search determines what can be inferred or chosen; begin with the stated conditions and keep the conclusion tied to the evidence.

Example: apply bin packing, sorting and binary search to one small, clearly defined case, show the key step or comparison, and explain the result in words.

Boundary: Bin packing, sorting and binary search is not a universal recommendation. Check the syllabus scope, assumptions, units and the limits of the evidence before generalising.