📚 Edexcel A-Level Programming: From Core Constructs to OOP and Algorithms | Edexcel A-Level 编程：从核心结构到面向对象与算法
Programming is the central problem-solving skill in Edexcel A-Level Computer Science. Students need to master variables, data types, control structures, subroutines, data structures, algorithms and object-oriented principles, because examination questions frequently blend trace tables, pseudocode analysis and algorithm design. This article covers the most important programming topics in the Edexcel specification in a structured revision format.
编程是 Edexcel A-Level 计算机科学中核心的问题解决技能。学生需要掌握变量、数据类型、控制结构、子程序、数据结构、算法以及面向对象原则，因为考试题目经常将跟踪表、伪代码分析和算法设计结合考查。本文以结构化复习形式覆盖 Edexcel 大纲中最重要的编程主题。
1. Variables, Constants, Data Types and Operators | 变量、常量、数据类型与运算符
In Edexcel pseudocode, a variable is a named storage location whose value can change while a program runs, whereas a constant is fixed at compile time and cannot be modified. Choosing the correct data type affects memory usage, arithmetic behaviour and the validity of operations such as string concatenation or integer division.
在 Edexcel 伪代码中，变量是程序运行时可更改值的命名存储位置，而常量在编译时固定，不能被修改。选择正确的数据类型会影响内存使用、算术行为以及字符串连接或整数除法等操作的有效性。
| Integer | whole numbers, e.g. 0, -5, 42 | 整型，例如 0、-5、42 |
| Real/Float | decimal numbers, e.g. 3.14, -0.5 | 实型/浮点型，例如 3.14、-0.5 |
| Boolean | TRUE or FALSE | 布尔型，TRUE 或 FALSE |
| Char | a single character, e.g. ‘A’, ‘7’ | 字符型，例如 ‘A’、’7’ |
| String | a sequence of characters, e.g. “hello” | 字符串型，例如 “hello” |
Typical operators include arithmetic operators +, -, *, /, MOD and DIV, comparison operators =, ≠, <, >, ≤, ≥, and logical operators AND, OR, NOT. Boolean expressions often appear in IF statements and WHILE loops, so you must be able to evaluate them without running the code.
典型运算符包括算术运算符 +、-、*、/、MOD、DIV，比较运算符 =、≠、<、>、≤、≥，以及逻辑运算符 AND、OR、NOT。布尔表达式经常出现在 IF 语句和 WHILE 循环中，因此你必须能够在不运行代码的情况下求出它们的值。
2. Sequence, Selection and Iteration | 顺序、选择与迭代
Every procedural program is built from three fundamental constructs: sequence, selection and iteration. Sequence means statements execute one after another in the order written. Selection uses IF…THEN…ELSE…ENDIF or CASE…OF…ENDCASE to choose between alternative blocks of code.
每个面向过程的程序都由三种基本结构组成：顺序、选择和迭代。顺序意味着语句按编写顺序依次执行。选择使用 IF…THEN…ELSE…ENDIF 或 CASE…OF…ENDCASE 在不同的代码块之间进行选择。
Iteration repeats a block of code and can be count-controlled or condition-controlled. A FOR loop repeats a known number of times, a WHILE loop tests the condition before each iteration, and a REPEAT…UNTIL loop tests the condition after the loop body, so the body always executes at least once.
迭代重复执行一段代码，可分为计数控制和条件控制。FOR 循环重复已知次数，WHILE 循环在每次迭代前检查条件，而 REPEAT…UNTIL 循环在循环体执行之后检查条件，因此循环体至少会执行一次。
3. Subroutines, Functions and Parameter Passing | 子程序、函数与参数传递
Subroutines are named blocks of code that can be called repeatedly. A procedure performs a task but returns no value, whereas a function always returns a value and can be used inside expressions. Parameter passing allows data to be sent into a subroutine.
子程序是可以重复调用的命名代码块。过程执行一个任务但不返回值，而函数总是返回一个值，并且可以用在表达式中。参数传递允许将数据送入子程序。
Parameters can be passed by value or by reference. Pass-by-value creates a local copy, so changes inside the subroutine do not affect the original variable. Pass-by-reference gives the subroutine access to the original memory location, so changes are applied to the variable outside the subroutine.
参数可以按值传递或按引用传递。按值传递会创建一个局部副本，因此子程序内部的更改不会影响原始变量。按引用传递使子程序可以访问原始内存位置，因此更改会作用到子程序外部的变量上。
4. Local and Global Variables | 局部变量与全局变量
A local variable is declared inside a subroutine and only exists while that subroutine is running. It cannot be accessed from other subroutines. A global variable is declared at the top of the program and can be read or modified from any part of the program.
局部变量在子程序内部声明，并且仅在该子程序运行期间存在。它不能被其他子程序访问。全局变量在程序顶部声明，可以从程序的任何部分读取或修改。
Global variables can create side effects: unexpected changes that make debugging difficult. In structured code, it is usually safer to pass values into subroutines as parameters and return results, rather than relying on global variables.
全局变量可能产生副作用：即难以调试的意外更改。在结构化代码中，通常更安全的做法是通过参数将值传入子程序并返回结果，而不是依赖全局变量。
5. String Handling, Arrays and Records | 字符串处理、数组与记录
String handling operations include finding the length, extracting a substring, concatenating strings, converting case, and reading individual characters by index. In Edexcel pseudocode, string indices may be specified as zero-based or one-based, so always check the question’s convention.
字符串处理操作包括求长度、提取子串、连接字符串、转换大小写，以及按索引读取单个字符。在 Edexcel 伪代码中，字符串索引可能规定从 0 或从 1 开始，因此一定要检查题目规定的约定。
Arrays store multiple items of the same data type in a single indexed structure. A one-dimensional array is a list; a two-dimensional array is like a table. Records store data of different types under named fields and are useful for modelling real-world objects such as a Student record with name, age and grade fields.
数组在单一索引结构中存储多个相同数据类型的数据项。一维数组相当于列表；二维数组类似于表格。记录以命名字段存储不同类型的数据，非常适合建模现实世界的对象，例如包含 name、age 和 grade 字段的 Student 记录。
6. File Handling and Exception Handling | 文件处理与异常处理
File handling allows programs to read from and write to external text or CSV files. The typical pattern is: open the file, read lines or records, process the data, write new data if needed, and close the file. This is essential for persistent storage because ordinary variables are lost when the program ends.
文件处理允许程序读取和写入外部文本或 CSV 文件。典型流程是：打开文件、读取行或记录、处理数据、在需要时写入新数据，然后关闭文件。这对持久存储至关重要，因为普通变量在程序结束时会丢失。
Exception handling manages runtime errors such as division by zero, invalid input conversion, or a missing file. TRY…EXCEPT…ENDTRY blocks allow a program to continue gracefully instead of crashing, and FINALLY code is used to release resources such as file handles.
异常处理用于管理运行时错误，例如除零、无效的输入转换或文件缺失。TRY…EXCEPT…ENDTRY 块允许程序优雅地继续运行而不是崩溃，FINALLY 代码用于释放诸如文件句柄等资源。
7. Stacks, Queues and Linked Lists | 栈、队列与链表
A stack is a last-in, first-out (LIFO) data structure. The main operations are push, pop and peek. Stacks are used for the call stack during subroutine calls, undo features and bracket matching. A queue is a first-in, first-out (FIFO) structure with enqueue, dequeue and front operations, commonly used in scheduling and buffering.
栈是一种后进先出（LIFO）的数据结构。主要操作是 push、pop 和 peek。栈用于子程序调用期间的调用栈、撤销功能以及括号匹配。队列是一种先进先出（FIFO）结构，具有 enqueue、dequeue 和 front 操作，常用于调度和缓冲。
Linked lists store nodes in non-contiguous memory; each node contains data and a pointer to the next node. Inserting or deleting a node does not require shifting elements, unlike arrays, but linked lists do not allow random access by index.
链表将节点存储在非连续内存中；每个节点包含数据和指向下一个节点的指针。与数组不同，插入或删除节点不需要移动元素，但链表不支持按索引随机访问。
8. Searching and Sorting Algorithms | 搜索与排序算法
Linear search checks each item in order until the target is found or the end is reached. It works on unsorted data and has average time complexity O(n). Binary search repeatedly halves a sorted array by comparing the target with the middle element, giving O(log n) time.
线性搜索按顺序检查每个数据项，直到找到目标或到达末尾。它可以用于未排序的数据，平均时间复杂度为 O(n)。二分搜索通过将目标与中间元素进行比较，不断将已排序数组折半，时间复杂度为 O(log n)。
Common sorting algorithms include bubble sort, insertion sort and merge sort. Bubble sort repeatedly swaps adjacent out-of-order elements and has O(n²) time. Insertion sort builds a sorted sublist one item at a time, also O(n²) in the worst case. Merge sort divides the list, sorts each half recursively and then merges them, achieving O(n log n) time.
常见排序算法包括冒泡排序、插入排序和归并排序。冒泡排序反复交换相邻的乱序元素，时间复杂度为 O(n²)。插入排序每次将一个项插入已排序子列表，最坏情况也是 O(n²)。归并排序将列表分半、递归排序每一半，然后合并它们，时间复杂度为 O(n log n)。
Bubble/Insertion O(n²) | Merge O(n log n) | Linear Search O(n) | Binary Search O(log n)
9. Object-Oriented Programming: Classes, Encapsulation, Inheritance and Polymorphism | 面向对象编程：类、封装、继承与多态
A class is a blueprint for creating objects. It defines attributes, which store data, and methods, which define behaviour. An object is an instance of a class. Encapsulation hides internal data by making attributes private and exposing public methods to access or modify them.
类是创建对象的蓝图。它定义用于存储数据的属性，以及定义行为的方法。对象是类的实例。封装通过将属性设为私有，并公开公有方法来访问或修改它们，从而隐藏内部数据。
Inheritance allows a subclass to reuse and extend the attributes and methods of a parent class. Polymorphism allows the same method name to behave differently depending on the object or parameter types; method overriding is a common form in which a subclass replaces a parent method with its own version.
继承允许子类复用和扩展父类的属性和方法。多态允许同一个方法名根据对象或参数类型表现出不同行为；方法重写是一种常见形式，即子类用自己的版本替换父类方法。
10. Recursion and Big O Notation | 递归与大O表示法
Recursion is a technique in which a subroutine calls itself to solve a smaller instance of the same problem. Every recursive routine must have a base case to stop the recursion and a recursive case that moves toward the base case. For example, factorial(n) can be defined as:
递归是一种子程序调用自身来解决同一问题的更小实例的技术。每个递归例程必须具有用于停止递归的基准情形，以及向基准情形推进的递归情形。例如，factorial(n) 可以定义为：
factorial(0) = 1 | factorial(n) = n × factorial(n-1) for n > 0
Big O notation describes the upper bound of an algorithm’s time or space growth as input size n increases. Common orders from fastest to slowest are O(1), O(log n), O(n), O(n log n), O(n²) and O(2ⁿ). Exam questions often require you to identify the order of a given algorithm from a nested loop structure.
大O表示法描述随着输入规模 n 增大，算法时间或空间增长的上界。从最快到最慢的常见阶为 O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。考试题目经常要求你根据嵌套循环结构判断给定算法的阶。
O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ)
11. Testing, Trace Tables and Debugging | 测试、跟踪表与调试
Testing is used to find errors and to check that a program meets its requirements. Black-box testing focuses on inputs and expected outputs without looking at the code, while white-box testing uses knowledge of the internal structure to test every path or branch. Normal, boundary and erroneous test data are all required.
测试用于发现错误并检查程序是否满足需求。黑盒测试关注输入和预期输出，而不查看代码；白盒测试则利用对内部结构的了解来测试每一条路径或分支。正常、边界和错误测试数据都是必需的。
A trace table records the values of variables after each statement during a dry run. It helps examiners understand how an algorithm works and is a very common Edexcel question format. Debugging tools in an IDE, such as breakpoints, step execution and watch variables, help locate and correct logic errors.
跟踪表在人工执行期间记录每条语句之后变量的值。它帮助考官理解算法如何工作，也是 Edexcel 非常常见的题型。IDE 中的调试工具，如断点、单步执行和监视变量，有助于定位和纠正逻辑错误。
12. Computational Thinking and Exam Technique | 计算思维与考试技巧
Computational thinking involves decomposition, abstraction, pattern recognition and algorithm design. Decomposition breaks a large problem into smaller sub-problems; abstraction removes unnecessary detail to focus on the relevant information; pattern recognition identifies similarities that can be solved with the same approach.
计算思维包括分解、抽象、模式识别和算法设计。分解将大问题拆分成较小的子问题；抽象移除不必要的细节以聚焦相关信息；模式识别找出可以用相同方法解决的相似之处。
In the Edexcel programming exam, always read the pseudocode conventions carefully, label variables and constants clearly, use indentation for nested control structures, and show intermediate values in trace tables. Practise writing pseudocode by hand because many students lose marks on syntax or missing ENDIF/ENDWHILE statements.
在 Edexcel 编程考试中，一定要仔细阅读伪代码约定，清楚地命名变量和常量，对嵌套控制结构使用缩进，并在跟踪表中写出中间值。要练习手写伪代码，因为许多学生因语法错误或缺少 ENDIF/ENDWHILE 语句而失分。
Published by TutorHao | A-Level Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导