Edexcel A-Level Programming: Core Constructs, Data Structures and Algorithm Efficiency | Edexcel A-Level 编程：核心结构、数据结构与算法效率

📚 Edexcel A-Level Programming: Core Constructs, Data Structures and Algorithm Efficiency | Edexcel A-Level 编程：核心结构、数据结构与算法效率

Programming at A-Level requires much more than writing code that runs. Edexcel examiners expect you to design robust solutions using the correct constructs, choose suitable data structures, and reason about algorithm efficiency under timed conditions. This article covers the core programming knowledge you need for the Edexcel specification, from variables and control flow to recursion and Big O notation.

A-Level 编程要求远不止写出能运行的代码。Edexcel 考官希望你能够使用正确结构设计稳健方案、选择合适的数据结构，并在限时条件下分析算法效率。本文涵盖 Edexcel 考试大纲的核心编程知识，从变量、控制流到递归与 Big O 表示法。

1. Programming Paradigms and Constructs | 编程范式与基本结构

Edexcel A-Level programming questions often assume a procedural or object-oriented approach. You must be able to read and write structured code that uses the three fundamental constructs: sequence, selection and iteration. A paradigm is a style of programming, and recognising the paradigm helps you predict how a given code fragment will behave.

Edexcel A-Level 编程题通常默认采用过程式或面向对象的方法。你必须能够阅读和编写使用三种基本结构的结构化代码：顺序、选择和迭代。范式是一种编程风格，识别范式有助于你预测给定代码片段的行为。

In the procedural paradigm, a program is broken down into procedures or functions that operate on data. In object-oriented programming, data and the methods that act on it are bundled into objects. Edexcel questions may ask you to identify advantages such as encapsulation, inheritance or code reuse.

在过程式范式中，程序被分解为对数据进行操作的过程或函数。在面向对象编程中，数据以及操作数据的方法被封装在对象里。Edexcel 题目可能要求你指出封装、继承或代码复用等优点。

2. Variables, Constants and Data Types | 变量、常量与数据类型

Variables are named storage locations whose values can change during execution. Constants are fixed values that cannot be modified once initialised. In pseudocode, Edexcel often uses keywords such as SET, INPUT, OUTPUT and CONSTANT to make the intended action clear.

变量是命名的存储位置，其值在程序执行期间可以改变。常量是一旦初始化后就不能修改的固定值。在伪代码中，Edexcel 经常使用 SET、INPUT、OUTPUT 和 CONSTANT 等关键字来清晰表达意图。

Common data types include integer, real, Boolean, character and string. Choosing the right data type affects memory usage and the validity of operations. For example, integer division truncates the result, while real division keeps the fractional part.

常见数据类型包括整数、实数、布尔型、字符和字符串。选择正确的数据类型会影响内存使用和操作的有效性。例如，整数除法会截断结果，而实数除法保留小数部分。

CONSTANT PI ← 3.14159
SET radius ← 5.0
SET area ← PI × radius²

3. Sequence, Selection and Iteration | 顺序、选择与迭代

Sequence means statements are executed one after another in the order written. Selection uses conditions to choose between alternative paths. Iteration repeats a block of code, either a fixed number of times or until a condition changes.

顺序意味着语句按照编写顺序一条接一条执行。选择使用条件在不同路径之间进行选择。迭代重复一段代码，可以是固定次数，也可以是直到某个条件发生变化。

Selection is typically implemented with IF...THEN...ELSE statements or CASE/SWITCH structures. Iteration is implemented with FOR, WHILE or REPEAT...UNTIL loops. Understanding the difference between pre-condition loops and post-condition loops is essential for trace table questions.

选择通常使用 IF...THEN...ELSE 语句或 CASE/SWITCH 结构实现。迭代使用 FOR、WHILE 或 REPEAT...UNTIL 循环实现。理解前置条件循环和后置条件循环之间的区别对于追踪表题目至关重要。

IF age ≥ 18 THEN OUTPUT “Adult” ELSE OUTPUT “Minor”

4. Arrays, Lists and Records | 数组、列表与记录

An array is a fixed-size collection of elements of the same data type, accessed by an index. A list is a dynamic collection that can grow or shrink, and its elements may be of different types in some languages. Records group related data of different types under one name.

数组是固定大小的相同数据类型元素集合，通过索引访问。列表是可以动态增长或缩小的集合，在某些语言中其元素可以具有不同数据类型。记录将相关的不同类型数据组合在一个名称下。

In Edexcel pseudocode, 1D arrays often use zero-based or one-based indexing depending on the question. You must be careful when tracing loops that use LEN(array) or array[i]. A record might look like Student.name, Student.age, Student.grade.

在 Edexcel 伪代码中，一维数组通常根据题目使用从 0 开始或从 1 开始的索引。在追踪使用 LEN(array) 或 array[i] 的循环时必须格外小心。一条记录可能形如 Student.name、Student.age、Student.grade。

Array: fixed size, same type, fast indexed access
List: dynamic size, insertion and deletion are easier
Record: groups related fields of different types

数组：固定大小，相同类型，索引访问快
列表：动态大小，插入和删除更容易
记录：组合不同类型的相关字段

5. Stacks and Queues | 栈与队列

A stack is a Last In First Out (LIFO) data structure. The main operations are push, pop and peek. Stacks are used in subroutine calls, undo features and expression evaluation.

栈是一种后进先出（LIFO）的数据结构。主要操作是入栈（push）、出栈（pop）和查看栈顶（peek）。栈用于子程序调用、撤销功能和表达式求值。

A queue is a First In First Out (FIFO) data structure. The main operations are enqueue and dequeue. Queues model waiting lines, printer buffers and breadth-first traversal. Edexcel questions often ask you to draw the state of a stack or queue after a sequence of operations.

队列是一种先进先出（FIFO）的数据结构。主要操作是入队（enqueue）和出队（dequeue）。队列模拟排队、打印缓冲区和广度优先遍历。Edexcel 题目经常要求你画出一系列操作后栈或队列的状态。

Stack: push A, push B, push C → pop → C, pop → B
Queue: enqueue A, enqueue B, enqueue C → dequeue → A, dequeue → B

6. Functions, Procedures and Parameter Passing | 函数、过程与参数传递

Functions return a value, while procedures perform a task without returning a value. Both help you break a large problem into manageable modules. Edexcel pseudocode often uses FUNCTION and PROCEDURE keywords to distinguish them.

函数返回一个值，而过程执行任务但不返回值。两者都有助于将大问题分解为可管理的模块。Edexcel 伪代码通常使用 FUNCTION 和 PROCEDURE 关键字来区分它们。

Parameter passing can be by value or by reference. Pass by value copies the argument, so changes inside the subroutine do not affect the original variable. Pass by reference passes the address, so changes do affect the original. Exam questions frequently test whether a variable has changed after a subroutine call.

参数传递可以按值或按引用进行。按值传递会复制实参，因此子程序内部的更改不会影响原始变量。按引用传递传递地址，因此更改会影响原始变量。考试题经常测试子程序调用后变量是否发生变化。

FUNCTION double(x)
RETURN x × 2
ENDFUNCTION

7. Recursion and Base Cases | 递归与基准情形

Recursion is a technique where a function calls itself to solve smaller subproblems. Every valid recursive algorithm must have a base case that stops the recursion, otherwise the program will cause a stack overflow.

递归是一种函数调用自身来解决更小子问题的技术。每个有效的递归算法都必须有一个基准情形来停止递归，否则程序将导致栈溢出。

Common examples include factorial, Fibonacci and binary tree traversal. Edexcel questions may ask you to trace a recursive function, identify the base case, or compare recursion with iteration in terms of memory use and readability.

常见示例包括阶乘、斐波那契数列和二叉树遍历。Edexcel 题目可能要求你追踪递归函数、识别基准情形，或从内存使用和可读性方面比较递归与迭代。

FUNCTION factorial(n)
IF n ≤ 1 THEN RETURN 1
ELSE RETURN n × factorial(n-1)
ENDFUNCTION

8. Searching Algorithms: Linear and Binary Search | 查找算法：线性查找与二分查找

Linear search checks every element one by one until the target is found or the end is reached. It works on unsorted data and has an average time complexity of O(n). It is simple but inefficient for large data sets.

线性查找逐个检查每个元素，直到找到目标或到达末尾。它适用于未排序的数据，平均时间复杂度为 O(n)。它简单，但对于大数据集效率较低。

Binary search repeatedly divides a sorted list in half. It compares the middle element with the target and discards the half that cannot contain the target. Its time complexity is O(log n), which is much faster for large sorted lists, but the data must be sorted first.

二分查找反复将有序列表一分为二。它将中间元素与目标进行比较，并丢弃不可能包含目标的那一半。其时间复杂度为 O(log n)，对于大型有序列表要快得多，但数据必须事先排序。

Binary search: low ← 0, high ← n-1
WHILE low ≤ high DO
mid ← (low + high) DIV 2
IF list[mid] = target THEN RETURN mid

9. Sorting Algorithms: Bubble, Insertion and Merge Sort | 排序算法：冒泡、插入与归并排序

Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. After each pass, the largest unsorted element bubbles to the end. Its worst-case time complexity is O(n²), and it is mainly useful for small or nearly sorted lists.

冒泡排序反复比较相邻元素，如果顺序错误则交换它们。每一趟之后，最大的未排序元素会冒泡到末尾。其最坏时间复杂度为 O(n²)，主要适用于小型或基本有序的列表。

Insertion sort builds a sorted front portion by inserting each new element into its correct position. It is efficient for small or partially sorted data with a best-case complexity of O(n), but its worst case is O(n²). Merge sort uses a divide and conquer strategy and always runs in O(n log n), but it requires additional memory.

插入排序通过将每个新元素插入到正确位置来构建有序的前部。它对于小型或部分有序的数据效率较高，最佳时间复杂度为 O(n)，但最坏情况为 O(n²)。归并排序采用分治策略，始终为 O(n log n)，但需要额外内存。

Algorithm	Best Case	Worst Case	Stable?
Bubble Sort	O(n)	O(n²)	Yes
Insertion Sort	O(n)	O(n²)	Yes
Merge Sort	O(n log n)	O(n log n)	Yes

10. Algorithm Efficiency and Big O Notation | 算法效率与 Big O 表示法

Big O notation describes how the running time or memory use of an algorithm grows as the input size n increases. It ignores constant factors and focuses on the dominant term, which is why O(3n + 5) is written as O(n).

Big O 表示法描述算法的运行时间或内存使用如何随着输入规模 n 的增大而增长。它忽略常数因子并关注主导项，因此 O(3n + 5) 写作 O(n)。

Common complexity classes include O(1) constant time, O(log n) logarithmic, O(n) linear, O(n log n) linearithmic, O(n²) quadratic and O(2ⁿ) exponential. Edexcel questions often ask you to compare two algorithms or determine the complexity of a simple loop structure.

常见复杂度类别包括 O(1) 常数时间、O(log n) 对数、O(n) 线性、O(n log n) 线性对数、O(n²) 平方和 O(2ⁿ) 指数。Edexcel 题目经常要求你比较两种算法或确定简单循环结构的复杂度。

FOR i ← 0 TO n-1 DO
FOR j ← 0 TO n-1 DO
sum ← sum + 1
END FOR
END FOR
→ Time complexity: O(n²)

11. Trace Tables and Debugging | 追踪表与调试

A trace table is a systematic way to record the values of variables at each step of an algorithm. Edexcel exams regularly include trace table questions because they test your ability to simulate code accurately and spot logical errors.

追踪表是一种系统记录算法每一步变量值的方法。Edexcel 考试经常包含追踪表题目，因为它们测试你准确模拟代码并发现逻辑错误的能力。

When completing a trace table, list all variables and conditions, update them line by line, and pay close attention to loop counters, Boolean expressions and array indices. Debugging techniques include dry running, adding temporary output statements, and checking boundary conditions such as n = 0 or n = 1.

完成追踪表时，列出所有变量和条件，逐行更新它们，并特别注意循环计数器、布尔表达式和数组索引。调试技术包括干运行、添加临时输出语句以及检查 n = 0 或 n = 1 等边界条件。

Write column headings for every variable and condition
Update values after each statement, not before
Check off each iteration to avoid missing a step
Use boundary test data: empty list, one element, maximum value

为每个变量和条件写列标题
在每条语句之后更新值，而不是之前
勾选每次迭代，避免遗漏步骤
使用边界测试数据：空列表、一个元素、最大值

12. Practical Exam Tips for Edexcel | Edexcel 考试实战技巧

Read pseudocode questions slowly and identify the inputs, outputs and important variables before tracing. Underline keywords such as WHILE, REPEAT and IF to prevent misreading loop boundaries.

阅读伪代码题目时放慢速度，在追踪前先确定输入、输出和重要变量。划出 WHILE、REPEAT 和 IF 等关键字，防止误读循环边界。

When asked to write an algorithm, plan the logic with a flowchart or bullet points before writing pseudocode. Use meaningful variable names and ensure every loop has a clear exit condition. For longer questions, show your working because method marks are often awarded even if the final answer is wrong.

当要求编写算法时，先用流程图或要点规划逻辑，再编写伪代码。使用有意义的变量名，并确保每个循环都有明确的退出条件。对于较长的题目，展示解题过程，因为即使最终答案错误，也常常能获得方法分。

Finally, practise converting between pseudocode, trace tables, flowcharts and high-level code. This cross-representation skill is frequently tested in Edexcel A-Level programming papers and is the fastest way to build exam confidence.

最后，练习在伪代码、追踪表、流程图和高级代码之间进行转换。这种跨表示技能在 Edexcel A-Level 编程试卷中经常考查，也是建立考试信心最快的方法。

Published by TutorHao | Programming Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

Edexcel A-Level Programming: Core Constructs, Data Structures and Algorithm Efficiency | Edexcel A-Level 编程：核心结构、数据结构与算法效率