4.2 – Connecting computational thinking and program design (HL & SL)
| Point | Description | More | |
| 4.2.1 | Describe the characteristics of standard algorithms on linear arrays | 4.2.1 | Searching Click Here Sorting Click here |
| 4.2.2 | Outline the standard operations of collections | 4.2.2 | Collections, Stacks & Queues Click here |
| 4.2.3 | Discuss an algorithm to solve a specific problem | 4.2.3 | |
| 4.2.4 | Analyse an algorithm presented as a flow chart | 4.2.4 | |
| 4.2.5 | Analyse an algorithm presented as pseudocode | 4.2.5 | Tracing pseudo and efficiency click here |
| 4.2.6 | Construct pseudocode to represent an algorithm | 4.2.6 | |
| 4.2.7 | Suggest suitable algorithms to solve a specific problem | 4.2.7 | |
| 4.2.8 | Deduce the efficiency of an algorithm in the context of its use | 4.2.8 | |
4.2.9 Iterations Activity Click here