150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear 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
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
73. OCR A Level (H046-H446) SLR13 - 1.4 Binary positive integers
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
39. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 4
134. OCR A Level (H446) SLR23 - 2.2 Recursion
137. OCR A Level (H046-H446) SLR23 - 2.2 Integrated development environments
142. OCR A Level (H446) SLR24 - 2.2 Divide & conquer
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
69. OCR A Level (H446) SLR12 - 1.3 PageRank algorithm revisited
162. OCR A Level (H446) SLR26 - 2.3 Big O notation in practice
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
