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
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
157. OCR A Level (H446) SLR26 - 2.3 Dijkstra's shortest path
38. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 3
37. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 2
134. OCR A Level (H446) SLR23 - 2.2 Recursion
A-level Computer Science Tree Traversal
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
117. OCR A Level (H046-H446) SLR18 - 2.1 The need for abstraction
143. OCR A Level (H446) SLR24 - 2.2 Use of abstraction
118. OCR A Level (H046-H446) SLR18 - 2.1 Abstraction & reality
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
CAPE COMP SCI U1: BINARY DECIMAL CALCULATIONS | MANTISSA | MAKE | IT | SIMPLE | TT
A* (Star) Search - Shortest Path Algorithm
AI/ML - A * Star Algorithm Explained - (A Level Computer Science Made Easy (A2) - 9618)
AI / ML : Dijkstra's Algorithm | Graph Data Structure ( A Level Computer Science Made Easy A2 9618 )
Programming Techniques, Programs, Translators and Languages: Sub program - OCR GCSE Computer Science
A Level OCR Computer Science Paper 2
34 A* (Star) Algorithm - A-Level Computer Science - www.revisecomputerscience.com