151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
152. OCR A Level (H046-H446) SLR25 - 2.3 Implement insertion sort
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
30. OCR A Level (H046) SLR6 - 2.2 Test strategies
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
148. OCR A Level (H046-H446) SLR25 - 2.3 Algorithms for the main data structures
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
130. OCR A Level (H046-H446) SLR21 - 2.1 Decisions & program flow
142. OCR A Level (H446) SLR24 - 2.2 Divide & conquer
139. OCR A Level (H446) SLR24 - 2.2 Features of a problem
160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
141. OCR A Level (H446) SLR24 - 2.2 Problem decomposition
107. OCR A Level (H046-H446) SLR16 - 1.5 Data Protection Act
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
161. OCR A Level (H446) SLR26 - 2.3 Comparison of the complexity of algorithms
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
