160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
161. OCR A Level (H446) SLR26 - 2.3 Comparison of the complexity of algorithms
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
162. OCR A Level (H446) SLR26 - 2.3 Big O notation in practice
159. OCR A Level (H446) SLR26 - 2.3 A star pathfinding revisited
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
155. OCR A Level (H446) SLR26 - 2.3 Implement merge sort
122. OCR A Level (H446) SLR19 - 2.1 Caching
36. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 1
142. OCR A Level (H446) SLR24 - 2.2 Divide & conquer
85. OCR A Level (H046-H446) SLR14 - 1.4 Arrays, records, lists & tuples
134. OCR A Level (H446) SLR23 - 2.2 Recursion
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
139. OCR A Level (H446) SLR24 - 2.2 Features of a problem
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
132. OCR A Level (H446) SLR22 - 2.1 Benefits & trade offs of concurrent processing
128. OCR A Level (H046-H446) SLR21 - 2.1 Decision points in a solution
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
90. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees
