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
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
118. OCR A Level (H046-H446) SLR18 - 2.1 Abstraction & reality
Concatenation of strings
2.1.2 Computational thinking -Thinking ahead
37. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 2
38. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 3
143. OCR A Level (H446) SLR24 - 2.2 Use of abstraction
117. OCR A Level (H046-H446) SLR18 - 2.1 The need for abstraction
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
134. OCR A Level (H446) SLR23 - 2.2 Recursion
AI / ML : Dijkstra's Algorithm | Graph Data Structure ( A Level Computer Science Made Easy A2 9618 )
Path Finding Algorithm Basics: The A* Algorithm in 10 Min
07 Compression Encryption Hashing - A-Level Computer Science - www.revisecomputerscience.com
AI/ML - A * Star Algorithm Explained - (A Level Computer Science Made Easy (A2) - 9618)
A2 Computer Science Component 2 Revision
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
A-level Computer Science Searching Algorithms