151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
152. OCR A Level (H046-H446) SLR25 - 2.3 Implement insertion sort
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
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
142. OCR A Level (H446) SLR24 - 2.2 Divide & conquer
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
128. OCR A Level (H046-H446) SLR21 - 2.1 Decision points in a solution
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
85. OCR A Level (H046-H446) SLR14 - 1.4 Arrays, records, lists & tuples
Quicksort - A Level Computer Science
158. OCR A Level (H446) SLR26 - 2.3 A star pathfinding
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
148. OCR A Level (H046-H446) SLR25 - 2.3 Algorithms for the main data structures
141. OCR A Level (H446) SLR24 - 2.2 Problem decomposition
91. OCR A Level (H446) SLR14 - 1.4 Data structures part 5 - Hash tables
145. OCR A Level (H446) SLR24 - 2.2 Performance modelling, pipelining & visualisation
