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
150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
148. OCR A Level (H046-H446) SLR25 - 2.3 Algorithms for the main data structures
30. OCR A Level (H046) SLR6 - 2.2 Test strategies
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
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
130. OCR A Level (H046-H446) SLR21 - 2.1 Decisions & program flow
162. OCR A Level (H446) SLR26 - 2.3 Big O notation in practice
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
29. OCR A Level (H046-H446) SLR6 - 1.2 Writing & following algorithms
161. OCR A Level (H446) SLR26 - 2.3 Comparison of the complexity of algorithms
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
135. OCR A Level (H046-H446) SLR23 - 2.2 Global & local variables
