📚 GCSE AQA Computer Science: Algorithms Revision Guide | GCSE AQA 计算机：算法 考点精讲
Algorithms are the building blocks of computer science, forming the logical heart of every program you will ever write. In the AQA GCSE specification, you are expected not only to understand what an algorithm is but also to design, trace, and compare them for efficiency and correctness. This guide covers fundamental concepts including abstraction, decomposition, pseudocode, flowcharts, structured English, common searching and sorting algorithms, and algorithm trace exercises, exactly as they appear in the AQA exam.
算法是计算机科学的基石，是你编写的每一个程序的逻辑核心。在 AQA GCSE 考试中，你不仅要理解算法的概念，还要能够设计、追踪算法并对其效率和正确性进行比较。本指南涵盖了抽象、分解、伪代码、流程图、结构化英语、常见的搜索与排序算法以及算法追踪练习等核心考点，完全贴合 AQA 考试要求。
1. What is an Algorithm? | 什么是算法？
An algorithm is a step-by-step, unambiguous set of instructions designed to solve a specific problem or perform a task. It must have a clear start and end, be finite, and produce a consistent output for a given input. In the AQA syllabus, you need to be able to represent algorithms using pseudocode, flowcharts, and structured English.
算法是一组逐步执行、无歧义的指令，旨在解决特定问题或完成某项任务。它必须有明确的起点和终点、是有限的，并且对于给定的输入产生一致的输出。在 AQA 课程中，你需要能够使用伪代码、流程图和结构化英语来表示算法。
Always remember: an algorithm is independent of any programming language. It is a logical blueprint, which can be translated into Python, Java, or any other language. The key skill is to think logically before coding.
始终记住：算法独立于任何编程语言。它是一个逻辑蓝图，可以翻译成 Python、Java 或任何其他语言。关键技能是在编码前进行逻辑思考。
2. Abstraction and Decomposition | 抽象与分解
Abstraction is the process of removing unnecessary detail from a problem so that you can focus on the essential parts. For example, when modelling a school timetable, you ignore the colour of the classroom walls and keep only subject, room number, and teacher. Decomposition means breaking a complex problem down into smaller, more manageable sub-problems that can be solved individually.
抽象是去除问题中不必要细节的过程，让你能够专注于核心部分。例如，在为学校课表建模时，你会忽略教室墙壁的颜色，只保留科目、房间号和教师。分解意味着将一个复杂问题拆分为更小、更易于管理的子问题，然后逐一解决。
AQA exam questions often ask you to identify how abstraction has been used in a given scenario, or to decompose a task such as creating a calculator program or a quiz game. Master these concepts early.
AQA 的考题经常会要求你指出在特定场景中如何运用抽象，或对一个任务进行分解，如制作计算器程序或问答游戏。尽早掌握这些概念。
3. Pseudocode and Structured English | 伪代码与结构化英语
Pseudocode is a simplified, human-readable representation of an algorithm that uses common programming constructs like IF…ELSE, WHILE, FOR, and OUTPUT. It does not follow strict syntax rules, but it must be clear and unambiguous. Structured English uses plain English with a limited set of keywords such as ‘START’, ‘IF’, ‘THEN’, ‘ELSE’, ‘REPEAT’, ‘UNTIL’, and ‘PRINT’.
伪代码是算法的简化、人类可读的表示形式，使用常见的编程结构如 IF…ELSE, WHILE, FOR 和 OUTPUT。它不遵循严格的语法规则，但必须清晰且无歧义。结构化英语则使用带限定关键字的简明英语，例如 ‘START’、’IF’、’THEN’、’ELSE’、’REPEAT’、’UNTIL’ 和 ‘PRINT’。
In the AQA exam, you might be given a problem and asked to write a solution in pseudocode, or to convert a flowchart into structured English. Practice these translations until they become second nature.
在 AQA 考试中，可能会给出一道题目要求你用伪代码写出解决方案，或将流程图转换为结构化英语。多加练习直到你能驾轻就熟。
4. Flowchart Symbols and Their Functions | 流程图符号及其功能
Flowcharts provide a visual way of representing algorithms. AQA expects you to recognise and use standard symbols: oval for Start/End, parallelogram for Input/Output, rectangle for Process, diamond for Decision, and arrows for flow direction. You must be able to trace a flowchart step by step and determine the output for given inputs.
流程图提供了算法的可视化表示。AQA 要求你识别并使用标准符号：椭圆形表示开始/结束，平行四边形表示输入/输出，矩形表示处理过程，菱形表示判断，箭头表示流程方向。你必须能够逐步追踪流程图，并确定给定输入下的输出结果。
Make sure your flow lines always have arrows, and that decision diamonds have exactly one entry point and two labelled exit branches (Yes/No or True/False). A tidy flowchart is easy to read and marks are awarded for clarity.
请确保流程线始终带有箭头，判断菱形仅有一个入口和两个带有标签的出口分支（是/否或真/假）。整洁的流程图易于阅读，清晰度本身也计分。
5. Trace Tables and Dry Running | 追踪表与干运行
A trace table is used to test an algorithm by manually stepping through each line and recording the changing values of variables. It is one of the most heavily examined skills in AQA GCSE Paper 1, where you must fill in the missing values in a partly completed trace table or create one from scratch.
追踪表用于测试算法，方法是手动执行每一行代码并记录变量值的变化。这是 AQA GCSE 试卷一中考频最高的技能之一，你需要补全部分给出的追踪表中的缺失值，或从零开始建立追踪表。
When dry running a loop, carefully check the condition each iteration and update all variables exactly as the pseudocode instructs. Remember to record the output only when the OUTPUT command is reached.
在干运行循环时，每次迭代都要仔细检查条件，并严格按照伪代码指令更新所有变量。记住，只有在执行到 OUTPUT 命令时才记录输出。
6. Linear Search Algorithm | 线性搜索算法
Linear search checks each element of a list in turn until the target value is found or the end of the list is reached. It works on both sorted and unsorted lists. In the worst case, it examines every item, making its time complexity O(n), but it is simple to implement and understand.
线性搜索依次检查列表中的每个元素，直到找到目标值或抵达列表末尾。它适用于已排序和未排序的列表。在最坏情况下，它会检查每一项，时间复杂度为 O(n)，但实现和理解都很简单。
In AQA pseudocode, a linear search is often written using a WHILE loop with a flag variable found. You must be able to trace it and state the number of comparisons made in a given scenario.
在 AQA 伪代码中，线性搜索通常使用 WHILE 循环和标记变量 found 来编写。你必须能够追踪它，并说明在特定场景中所进行的比较次数。
7. Binary Search Algorithm | 二分搜索算法
Binary search works by repeatedly dividing a sorted list in half. It compares the middle element with the target; if they are not equal, it discards the half that cannot contain the target. This logarithmic approach gives it a time complexity of O(log n), making it much faster than linear search for large, sorted datasets.
二分搜索通过反复将已排序列表对半分来工作。它比较中间元素与目标值；如果不相等，则丢弃不可能包含目标值的那一半。这种对数级的方法使其时间复杂度为 O(log n)，对于大型有序数据集，它比线性搜索快得多。
You must recall the precise AQA pseudocode for binary search, including the initialisation of low and high pointers and the calculation of the midpoint using (low + high) DIV 2. Make sure you know when the algorithm terminates (when low exceeds high).
你必须牢记二分搜索的精确 AQA 伪代码，包括 low 和 high 指针的初始化，以及使用 (low + high) DIV 2 计算中点。确保你知道算法在何时终止（当 low 超过 high 时）。
8. Bubble Sort Algorithm | 冒泡排序算法
Bubble sort repeatedly steps through a list, comparing adjacent items and swapping them if they are in the wrong order. Each pass puts the next largest element into its correct position at the end. The algorithm stops when a complete pass is made without any swaps. It is O(n²) in the worst case.
冒泡排序反复遍历列表，比较相邻的两个元素并在顺序错误时交换它们。每一趟遍历会把下一个最大的元素放到末尾的正确位置。当某趟遍历没有发生任何交换时算法停止。最坏情况下的时间复杂度为 O(n²)。
In the AQA exam, you will likely be asked to complete a trace of bubble sort, showing the state of the list after each pass, or to write pseudocode for it. A swapped flag is commonly used to detect if any swaps occurred.
在 AQA 考试中，你很可能需要完成冒泡排序的追踪，展示每一趟遍历后列表的状态，或为之编写伪代码。通常会使用一个标志位 swapped 来检测是否发生了交换。
9. Merge Sort Algorithm | 归并排序算法
Merge sort is a divide-and-conquer algorithm that splits a list into sub-lists of length 1, then repeatedly merges these sub-lists back together in sorted order. Its time complexity is O(n log n) in all cases, making it more efficient than bubble sort for large lists, but it requires extra memory for the merging process.
归并排序是一种分治算法，它将列表拆分成长度为 1 的子列表，然后反复将这些子列表以有序方式合并回去。所有情况下它的时间复杂度均为 O(n log n)，对于大型列表它比冒泡排序更高效，但在合并过程中需要额外内存。
You should understand the merge process: compare the first elements of two sorted lists, take the smaller one, and repeat until one list is empty, then append the remainder. AQA diagrams often show the splitting and merging stages as a tree.
你应该理解合并过程：比较两个有序列表的第一个元素，取较小的那个，重复直到某个列表为空，然后将剩余部分追加进去。AQA 的图表经常以树状形式展示拆分与合并的阶段。
10. Comparing Sorting Algorithms | 排序算法对比
When choosing a sorting algorithm, consider the data size and whether the list is partially sorted. Bubble sort is simple and needs no extra memory but is slow for large N. Merge sort is much faster for large N but uses more memory. AQA may ask you to justify the choice of algorithm for a given situation, highlighting pros and cons.
在选择排序算法时，要考虑数据量和列表是否部分有序。冒泡排序简单且不需要额外内存，但在数据量大时速度慢。归并排序对于大量数据要快得多，但会占用更多内存。AQA 可能会要求你针对给定情况证明算法选择的合理性，并突出其优缺点。
A comparison table is a great way to revise:
使用对比表格是一种很好的复习方式：
| Feature / 特征 | Bubble Sort / 冒泡排序 | Merge Sort / 归并排序 |
|---|---|---|
| Time complexity (worst) / 时间复杂度（最坏） | O(n²) | O(n log n) |
| Space complexity / 空间复杂度 | O(1) (in-place) / 原地 | O(n) (needs extra arrays) / 需要额外数组 |
| Preserves order of equal elements? / 保持相等元素顺序？ | Yes (stable) / 是（稳定） | Yes (stable) / 是（稳定） |
| Works well on small/large N? / 适用于小/大 N？ | Small N only / 仅小 N | Large N preferred / 优选大 N |
11. Linear Search vs Binary Search | 线性搜索与二分搜索对比
Linear search works on any list but is slow. Binary search requires the list to be sorted, but once sorted, it is dramatically faster for large datasets. In many exam questions, you may need to state how many comparisons each would take for a list of 1000 elements: binary search at most about 10 comparisons, linear search up to 1000.
线性搜索适用于任何列表但速度慢。二分搜索要求列表已排序，但一旦排序完成，对于大型数据集它的速度快得惊人。在许多考试题中，你可能需要说明对含 1000 个元素的列表，两种搜索各需多少次比较：二分搜索最多约 10 次，而线性搜索可达 1000 次。
An important nuance: binary search compares the middle element first, then adjusts low/high pointers; linear search starts at index 0 and goes step by step. Always be prepared to trace both from a given pseudocode snippet.
一个重要的细微之处：二分搜索首先比较中间元素，然后调整 low/high 指针；线性搜索则从索引 0 开始逐步进行。随时准备好根据给定的伪代码片段对这两种搜索进行追踪。
12. Exam Tips and Common Pitfalls | 考试技巧与常见陷阱
When an exam question asks you to ‘explain how the algorithm works’, structure your answer in clear steps using command words like ‘first’, ‘next’, ‘then’. Avoid vague language. For trace tables, ensure you write values in the correct row and column; if a variable does not change, repeat its value. Check that your pseudocode matches the flowchart exactly if you are doing a conversion.
当考题要求你“解释算法是如何工作的”时，请使用“首先”、“接下来”、“然后”等指示词，以清晰的步骤组织答案。避免含糊不清的表述。对于追踪表，确保将数值填写在正确的行和列中；如果变量没有变化，则重复其值。在进行转换时，要检查伪代码是否与流程图完全匹配。
Time management is crucial: algorithm tracing can be time-consuming. Practice with past papers to get faster. If you are unsure about a sorting pass, complete it step by step rather than trying to visualise the final result instantly.
时间管理至关重要：算法追踪可能很耗时。通过练习历年真题来提高速度。如果你对某一趟排序不确定，请一步步完成，而不要试图立即构想最终结果。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导