157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
156. OCR A Level (H446) SLR26 - 2.3 Implement quick sort
161. OCR A Level (H446) SLR26 - 2.3 Comparison of the complexity of algorithms
159. OCR A Level (H446) SLR26 - 2.3 A star pathfinding revisited
160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
155. OCR A Level (H446) SLR26 - 2.3 Implement merge sort
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
116. OCR A Level (H046-H446) SRL18 - 2.1 The nature of abstraction
153. OCR A Level (H046-H446) SLR25 - 2.3 Representing, adding & removing from queues & stacks
137. OCR A Level (H046-H446) SLR23 - 2.2 Integrated development environments
162. OCR A Level (H446) SLR26 - 2.3 Big O notation in practice
133. OCR A Level (H046-H446) SLR23 - 2.2 Programming constructs
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
Dijkstra’s Algorithm Solved Question ( 9618/33/M/J/21 Question 5 ) - A Level Computer Science
25. OCR A Level (H446) SLR5 - 1.2 Stages of compilation
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
148. OCR A Level (H046-H446) SLR25 - 2.3 Algorithms for the main data structures
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms