150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
153. OCR A Level (H046-H446) SLR25 - 2.3 Representing, adding & removing from queues & stacks
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
154. OCR A Level (H046-H446) SLR25 - 2.3 Comparing suitability of algorithms
149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
152. OCR A Level (H046-H446) SLR25 - 2.3 Implement insertion sort
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
123. OCR A Level (H046-H446) SLR19 - 2.1 Reusable components
122. OCR A Level (H446) SLR19 - 2.1 Caching
128. OCR A Level (H046-H446) SLR21 - 2.1 Decision points in a solution
142. OCR A Level (H446) SLR24 - 2.2 Divide & conquer
89. OCR A Level (H046-H446) SLR14 - 1.4 Data structures part 3 - Stacks & queues
124. OCR A Level (H046-H446) SLR20 - 2.1 Identify components of a problem
127. OCR A Level (H046-H446) SLR20 - 2.1 Identify sub procedures
91. OCR A Level (H446) SLR14 - 1.4 Data structures part 5 - Hash tables
131. OCR A Level (H446) SLR22 - 2.1 Tackling concurrent problems
133. OCR A Level (H046-H446) SLR23 - 2.2 Programming constructs
137. OCR A Level (H046-H446) SLR23 - 2.2 Integrated development environments
144. OCR A Level (H446) SLR24 - 2.2 Backtracking, data mining & heuristics
