📚 GCSE Edexcel Maths: Algorithms Revision Guide | GCSE Edexcel 数学：算法 考点精讲
Algorithms form a key part of the GCSE Edexcel Mathematics syllabus, bridging logical reasoning with computational thinking. An algorithm is simply a step-by-step procedure or set of rules designed to solve a specific problem or complete a task. In the exam, you will be expected to interpret, analyse, correct, and even write your own simple algorithms, often presented as flowcharts or ordered lists of instructions. This guide breaks down every essential topic, from basic structures to common pitfalls, so you can approach algorithm questions with confidence.
算法是 GCSE Edexcel 数学大纲的重要组成部分，它将逻辑推理与计算思维连接起来。算法就是为解决特定问题或完成任务而设计的一系列步骤或规则。在考试中，你需要能够解读、分析、纠正，甚至编写简单的算法，通常以流程图或指令列表的形式出现。本指南逐一剖析每个核心主题，从基本结构到常见易错点，帮助你自信应对算法题。
1. What is an Algorithm? | 什么是算法？
An algorithm is a finite sequence of unambiguous instructions that, when followed, will solve a given problem. In GCSE maths, these could be number puzzles, sorting tasks, or simple data manipulation routines. The key features are: each step is clearly defined, the process must eventually terminate, and it should produce the correct output for valid inputs. You do not need to know any specific programming language; instead, focus on logical structure and the ability to follow a set of rules precisely.
算法是一系列明确、有限的指令，按照这些指令执行就能解决给定的问题。在 GCSE 数学中，算法可能是数字谜题、排序任务或简单的数据处理过程。其关键特征是：每一步都有清晰的界定、过程最终必须终止，并且对有效输入应给出正确输出。你不需要掌握任何特定的编程语言，重点是理解逻辑结构，并能准确遵循一组规则。
2. Flowchart Symbols | 流程图符号
In Edexcel exams, algorithms are frequently represented as flowcharts. You must know the standard symbols: an oval for Start/End, a rectangle for a process or instruction (e.g. “x ← x + 1”), a diamond for a decision (Yes/No question), and a parallelogram for input/output. Arrows indicate the direction of flow. A table summarising these is shown below.
在 Edexcel 考试中，算法常常以流程图的形式呈现。你必须掌握标准符号：椭圆形表示开始/结束，矩形表示处理或指令（例如 “x ← x + 1″），菱形表示决策（是/否问题），平行四边形表示输入/输出。箭头指示流程方向。下表总结了这些符号。
| Symbol | Name | Purpose |
|---|---|---|
| ⬭ Oval | 椭圆 | Start or End of the algorithm |
| ▭ Rectangle | 矩形 | Process / instruction |
| ◇ Diamond | 菱形 | Decision (Yes/No) |
| ▱ Parallelogram | 平行四边形 | Input or Output |
| → Arrow | 箭头 | Flow direction |
3. Sequence | 顺序执行
The simplest structure is sequence: performing one step after another in a fixed order. Even a recipe is an algorithm – mix ingredients, bake, cool. In a flow chart, boxes follow each other vertically with arrows connecting them. When you are asked to read or write a sequential algorithm, check that each step is logically placed and that no crucial operation is omitted. Misplacing a step can completely change the output.
最简单的结构是顺序执行：按固定顺序一步一步执行。甚至一个食谱也是算法——混合原料、烘焙、冷却。在流程图中，矩形框通过箭头依次垂直排列。当你要阅读或编写顺序算法时，务必检查每一步是否合乎逻辑，且没有遗漏关键操作。步骤错位会完全改变输出结果。
4. Selection | 选择结构
Selection introduces decision-making using an ‘IF…THEN…ELSE’ structure. A condition is tested, and the flow branches accordingly. In a flowchart, this appears as a diamond with one entry and two exits (labelled ‘Yes’ and ‘No’). Common conditions include comparisons like A > B, count < 10, or answer = "Yes". Be comfortable tracing both branches and identifying the outcome for given input values.
选择结构通过’IF…THEN…ELSE’实现决策。程序测试一个条件，并根据结果分支。在流程图中，这表现为一个菱形，有一个入口和两个出口（标记为’是’和’否’）。常见条件包括比较，如 A > B、count < 10、answer = "Yes"。要能熟练地追踪两条分支，并根据给定的输入值确定结果。
For example, an algorithm might say: IF score ≥ 50 THEN grade ← “Pass” ELSE grade ← “Fail”. The flowchart would show the diamond with the question “score ≥ 50?” leading to two distinct process boxes.
例如，一个算法可能写：IF score ≥ 50 THEN grade ← “Pass” ELSE grade ← “Fail”。相应的流程图会显示菱形，其中包含问题 “score ≥ 50？”，并引出两个不同的处理框。
5. Iteration (Loops) | 循环结构
Iteration allows a set of instructions to be repeated. There are two main types: count-controlled loops (e.g. FOR i = 1 TO 10 ) and condition-controlled loops (e.g. WHILE total < 100). In a flowchart, a decision diamond is used to control the loop: after executing the body, the condition is checked; if true, the flow returns to repeat the body; if false, the loop exits. Recognising when a loop finishes is a vital skill for tracing algorithms.
循环允许重复执行一组指令。主要有两类：计数控制循环（例如 FOR i = 1 TO 10）和条件控制循环（例如 WHILE total < 100）。在流程图中，使用决策菱形来控制循环：执行完循环体后，检查条件；若为真，流程返回重复循环体；若为假，则退出循环。判断循环何时终止是追踪算法的关键技能。
A count-controlled loop example:
FOR n = 1 TO 5
OUTPUT n
NEXT n
计数控制循环示例：
FOR n = 1 TO 5
输出 n
NEXT n
This would output the numbers 1, 2, 3, 4, 5. Pay attention to whether the final value is included.
这将输出数字 1、2、3、4、5。注意最终值是否包含在内。
6. Tracing Algorithms | 追踪算法
Tracing means running the algorithm step-by-step on paper to record how variables change. A common exam question provides a flowchart or pseudo-code and asks: “What is the output when the input is 7?” You should draw a trace table with columns for each variable and the output. Update the table at each step. This methodical approach prevents errors and is strongly recommended by examiners.
追踪是指在纸上一步一步运行算法，并记录变量的变化情况。常见的考试题会给出流程图或伪代码，并问：”当输入为 7 时，输出是什么？”你应该画一个追踪表，为每个变量和输出设置列，并在每一步更新表格。这种系统的方法可以防止错误，是考官强烈推荐的做法。
Example trace for a simple algorithm that doubles a number and adds 3:
简单算法示例追踪：将一个数加倍再加 3。
| Step | x | result | Output |
|---|---|---|---|
| Start | 5 | – | – |
| 1 | 5 | 10 | – |
| 2 | 5 | 13 | 13 |
Notice that intermediate values are recorded, making it easy to spot logic errors.
注意中间值都被记录下来，这样就能轻松发现逻辑错误。
7. Example: Finding the Maximum | 示例：寻找最大值
Algorithms often involve searching or sorting a list. A classic example is “Find the largest number in a list”. The algorithm works by assuming the first number is the maximum, then comparing it with every other element. If a larger value is found, the maximum is updated. Here is a possible flow: Start → input list length N → input first number as max → FOR i=2 TO N: input next number; IF number > max THEN max ← number → NEXT i → output max → End.
算法通常涉及列表的搜索或排序。一个经典的例子是”找出列表中的最大数”。算法假设第一个数是最大值，然后将其与其他所有元素逐一比较。如果找到更大的值，就更新最大值。可能的流程是：开始→输入列表长度 N→输入第一个数并设为 max→FOR i=2 TO N：输入下一个数；IF number > max THEN max ← number→NEXT i→输出 max→结束。
When tracing, you might be given the list: 8, 3, 12, 5. Your trace table would show max starting at 8, then changing to 12 at the third element. This reinforces the importance of proper initialisation and updating conditions.
当你追踪时，可能会给出列表 8, 3, 12, 5。你的追踪表会显示 max 最初为 8，然后在第三个元素处变为 12。这强调了正确初始化和更新条件的重要性。
8. Correcting and Completing Algorithms | 纠正并补全算法
Examination questions might present a broken or incomplete algorithm and ask you to fix it. Common errors include: missing initialisation of variables, incorrect loop boundaries (off-by-one errors), placing instructions inside/outside a loop incorrectly, or using a wrong comparison operator (e.g. > instead of ≥). You should carefully analyse the intended behaviour, trace the given algorithm with sample data, and identify where it deviates from the expected outcome.
考试题可能会给出一个错误的或不完整的算法，并要求你修正。常见错误包括：变量未初始化、循环边界错误（差一错误）、指令被错误地放在循环内部或外部、使用错误的比较运算符（例如用 > 代替 ≥）。你应该仔细分析预期的行为，用样例数据追踪给定的算法，找出它与预期结果不符的地方。
9. Common Mistakes in Flowcharts | 流程图常见错误
Even if an algorithm logically works, marks can be lost for poor flowchart conventions. Never use more than one arrow pointing out of a process box except from a decision. Always label decision branches ‘Yes’ and ‘No’. Ensure flow lines do not cross unnecessarily. If an algorithm reads input in the middle of a process, that input must be shown with a parallelogram. A rectangle containing “Input x” is incorrect.
即使算法逻辑上可行，也可能因为流程图规范不佳而丢分。除了决策菱形外，处理框绝不要有超过一个的引出箭头。一定要为决策分支标注”是”和”否”。确保流程线不会不必要地交叉。如果算法在处理过程中读取输入，必须用平行四边形表示。用矩形写”输入 x”是不正确的。
Another mistake is forgetting the End symbol; every flowchart must have a Terminator at the start and at the finish. Loops that never terminate (infinite loops) will result in loss of marks and must be avoided by properly updating the loop control variable.
另一个错误是忘记结束符号；每个流程图都必须在开始和结束处各有一个终结符。循环永不终止（无限循环）会导致失分，必须通过正确更新循环控制变量来避免。
10. Exam Tips | 考试技巧
Read the entire algorithm before you start tracing. Identify the variables and the loop structure. Use a pencil and ruler to draw trace tables neatly; they do not have to be perfectly formatted but should be legible. If asked to write an algorithm, first plan it using bullet points or a rough flowchart. Show all steps, including initialisation and output. In Edexcel GCSE, answers can be given as a flowchart or a list of ordered statements; choose whichever you are more comfortable with, but ensure all steps are unambiguous.
在开始追踪之前，通读整个算法。识别变量和循环结构。用铅笔和尺子整洁地绘制追踪表；不必有完美的格式，但要清晰易读。如果要求你编写算法，先用要点或草拟流程图进行规划。展示所有步骤，包括初始化和输出。在 Edexcel GCSE 中，答案可以以流程图或有序语句列表的形式给出；选择你更得心应手的方式，但要确保所有步骤都明确无误。
Time management is crucial. Algorithm questions often carry up to 6 marks and may involve multiple parts. Do not get stuck on an obscure error; if you cannot trace a loop by eye, quickly work through two or three iterations until the pattern becomes clear. And always double-check boundary conditions – what happens when the input is zero, negative, or the list is empty? While these may not always be tested explicitly, they strengthen your understanding.
时间管理至关重要。算法题通常分值高达 6 分，且可能包含多个部分。不要纠结于一个难以察觉的错误；如果你无法凭眼力追踪循环，就快速进行两三次迭代，直到模式清晰。同时要反复检查边界条件——当输入为零、为负或列表为空时会发生什么？虽然这些可能不会直接考查，但它们能加深你的理解。
11. Real-world Applications | 现实应用
Algorithms are not just an exam topic; they underpin modern technology. Search engines use algorithms to rank pages, navigation software finds the shortest route using Dijkstra’s algorithm or A*, and online shopping recommendations come from collaborative filtering algorithms. Understanding algorithmic thinking helps you appreciate why certain operations are efficient while others are not. Edexcel questions sometimes reference real-life scenarios like calculating bills with discounts or determining the best route, thus tying the abstract to practical applications.
算法不仅是考试主题，更是现代技术的基石。搜索引擎使用算法对网页排序，导航软件用迪杰斯特拉算法或 A* 算法寻找最短路径，在线购物推荐则来自协同过滤算法。理解算法思维能帮你明白为什么有些操作高效而有些则不然。Edexcel 题目有时会引用现实场景，如计算带折扣的账单或确定最佳路线，从而将抽象概念与实际应用联系起来。
12. Summary and Key Takeaways | 总结与要点
Algorithms in GCSE Edexcel Maths revolve around sequence, selection, and iteration. You must be able to interpret flowcharts, trace values using tables, correct incomplete logic, and communicate steps clearly. Focus on the accuracy of logical flow, proper use of symbols, and careful management of variables. With consistent practice on past paper questions, you can master this topic and use it to strengthen your overall problem-solving skills on the exam.
GCSE Edexcel 数学中的算法围绕顺序、选择和循环展开。你必须能够解读流程图、用表格追踪数值、纠正不完整的逻辑、并清晰地表达步骤。重点关注逻辑流程的准确性、符号的正确使用以及变量的谨慎管理。通过持续练习往年真题，你就能掌握这一主题，并借此提升考试中整体的解题能力。
Published by TutorHao | Maths Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply