151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
152. OCR A Level (H046-H446) SLR25 - 2.3 Implement insertion sort
150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
153. OCR A Level (H046-H446) SLR25 - 2.3 Representing, adding & removing from queues & stacks
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
148. OCR A Level (H046-H446) SLR25 - 2.3 Algorithms for the main data structures
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
123. OCR A Level (H046-H446) SLR19 - 2.1 Reusable components
116. OCR A Level (H046-H446) SRL18 - 2.1 The nature of abstraction
122. OCR A Level (H446) SLR19 - 2.1 Caching
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
133. OCR A Level (H046-H446) SLR23 - 2.2 Programming constructs
137. OCR A Level (H046-H446) SLR23 - 2.2 Integrated development environments
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
141. OCR A Level (H446) SLR24 - 2.2 Problem decomposition
107. OCR A Level (H046-H446) SLR16 - 1.5 Data Protection Act
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
53. OCR A Level (H446) SLR10 - 1.3 Normalisation to 3NF revisited