162. OCR A Level (H446) SLR26 - 2.3 Big O notation in practice
161. OCR A Level (H446) SLR26 - 2.3 Comparison of the complexity of algorithms
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
155. OCR A Level (H446) SLR26 - 2.3 Implement merge sort
156. OCR A Level (H446) SLR26 - 2.3 Implement quick sort
126. OCR A Level (H046-H446) SLR20 - 2.1 Steps to solve a problem
105. OCR A Level (H446) SLR15 - 1.4 Half & full adders
118. OCR A Level (H046-H446) SLR18 - 2.1 Abstraction & reality
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
36. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 1
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
Little Man Computer A Level CS exam revision worked example
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
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
141. OCR A Level (H446) SLR24 - 2.2 Problem decomposition
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
132. OCR A Level (H446) SLR22 - 2.1 Benefits & trade offs of concurrent processing