155. OCR A Level (H446) SLR26 - 2.3 Implement merge sort
156. OCR A Level (H446) SLR26 - 2.3 Implement quick sort
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
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
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
88. OCR A Level (H446) SLR14 - 1.4 Data structures part 2 - Graphs
87. OCR A Level (H446) SLR14 - 1.4 Data structures part 1 - Linked lists
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
95. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees (operations)
92. OCR A Level (H446) SLR14 - 1.4 Data structures part 1 - Linked lists (operations)
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
96. OCR A Level (H446) SLR14 - 1.4 Data structures part 5 - Hash tables (operations)
85. OCR A Level (H046-H446) SLR14 - 1.4 Arrays, records, lists & tuples
93. OCR A Level (H446) SLR14 - 1.4 Data structures part 2 - Graphs (operations)
90. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees
116. OCR A Level (H046-H446) SRL18 - 2.1 The nature of abstraction
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
