2.1 Algorithms

In this module, you will learn how computational thinking and algorithms are used to solve problems logically and systematically. Algorithms are a fundamental part of computer science, providing clear sequences of instructions that can be designed, tested, refined, and implemented as programs.

You will begin by exploring computational thinking, including abstraction, decomposition, and algorithmic thinking. These principles help break complex problems into manageable parts, remove unnecessary detail, and develop logical step-by-step solutions.

Next, you will learn how algorithms are designed and represented using structure diagrams, pseudocode, flowcharts, and high-level programming languages. You will explore inputs, processes, and outputs, and learn how trace tables can be used to test algorithms and identify syntax and logic errors.

Finally, you will explore standard searching and sorting algorithms, including Binary Search, Linear Search, Bubble Sort, Merge Sort, and Insertion Sort. You will learn how each algorithm works, apply them to data sets, compare their methods, and recognise key implementations from code or pseudocode.