4.2.1 Describe the characteristics of the standard algorithms: sequential search, binary search, bubble sort, selection sort on linear arrays.

4.2.8 Deduce the efficiency of an algorithm in the context of its use. (BigO)

4.2.9 Determine the number of times a step in an algorithm will be performed for given input data. (BigO)

4.3.13 Construct algorithms using one- dimensional arrays and/or collections.

D.3.8 Construct code examples related to static arrays.

D.4.12 Trace algorithms using the implementations described in assessment statements 

5.1.4 Describe the characteristics of a two- dimensional array.

5.1.5 Construct algorithms using two- dimensional arrays.