2.3.1a Analysis and design of algorithms for a given situation
2.3.1f Standard algorithms (bubble sort, insertion sort, binary search and linear search), implement bubble sort, insertion sort, binary and linear search
2.3.1e Representing, adding data to and removing data from queues and stacks
2.3.1b Compare the suitability of different algorithms for a given task and data set