150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
152. OCR A Level (H046-H446) SLR25 - 2.3 Implement insertion sort
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
153. OCR A Level (H046-H446) SLR25 - 2.3 Representing, adding & removing from queues & stacks
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
143. OCR A Level (H446) SLR24 - 2.2 Use of abstraction
116. OCR A Level (H046-H446) SLR18 - 2.1 The nature of abstraction
29. OCR A Level (H046-H446) SLR6 - 1.2 Writing & following algorithms
142. OCR A Level (H446) SLR24 - 2.2 Divide & conquer
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
155. OCR A Level (H446) SLR26 - 2.3 Implement merge sort
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
127. OCR A Level (H046-H446) SLR20 - 2.1 Identify sub procedures
