149. OCR A Level (H046-H446) SLR25 - 2.3 Implement linear search
148. OCR A Level (H046-H446) SLR25 - 2.3 Algorithms for the main data structures
150. OCR A Level (H046-H446) SLR25 - 2.3 Implement binary search
146. OCR A Level (H046-H446) SLR25 - 2.3 Analysis &design of algorithms
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
147. OCR A Level (H046-H446) SLR25 - 2.3 Standard algorithms
152. OCR A Level (H046-H446) SLR25 - 2.3 Implement insertion sort
151. OCR A Level (H046-H446) SLR25 - 2.3 Implement bubble sort
38. OCR A Level (H446) SLR7 - 1.2 Object-oriented languages part 3
121. OCR A Level (H046-H446) SLR19 - 2.1 Determining preconditions
137. OCR A Level (H046-H446) SLR23 - 2.2 Integrated development environments
85. OCR A Level (H046-H446) SLR14 - 1.4 Arrays, records, lists & tuples
139. OCR A Level (H446) SLR24 - 2.2 Features of a problem
88. OCR A Level (H446) SLR14 - 1.4 Data structures part 2 - Graphs
155. OCR A Level (H446) SLR26 - 2.3 Implement merge sort
160. OCR A Level (H446) SLR26 - 2.3 Measures and methods to determine efficiency of algorithms
90. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees
135. OCR A Level (H046-H446) SLR23 - 2.2 Global & local variables
95. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees (operations)
