📚 Edexcel A-Level Programming: From Core Constructs to Algorithm Design | Edexcel A-Level 编程：从核心结构到算法设计
Programming is at the heart of the Edexcel A-Level Computer Science specification. Candidates must be able to trace, write and evaluate code in a high-level language, applying core constructs to solve problems efficiently. This revision guide covers the essential programming techniques, data structures and algorithms you need for both Paper 1 and the practical programming project.
编程是 Edexcel A-Level 计算机科学考试的核心。考生必须能够跟踪、编写和评估高级语言代码，运用核心结构高效地解决问题。本复习指南涵盖 Paper 1 和编程实践项目所需的基本编程技术、数据结构和算法。
1. Sequence, Selection and Iteration | 顺序、选择与迭代
The three fundamental control structures are sequence, selection and iteration. Sequence executes statements in written order; selection uses if, else if and switch-case statements; iteration repeats blocks with for, while and do-while loops. Every program can be built from these three building blocks.
三种基本控制结构是顺序、选择和迭代。顺序按书写顺序执行语句；选择使用 if、else if 和 switch-case 语句；迭代使用 for、while 和 do-while 循环重复代码块。每个程序都可以由这三个基本构件组成。
Edexcel questions often ask you to convert a flowchart or pseudocode into a working program. You must be confident with nested conditions and loop counters, including off-by-one errors. For example, a loop that should run 10 times but uses counter < 10 will stop after 10 iterations, while counter <= 10 will run 11 times.
Edexcel 考题经常要求你将流程图或伪代码转换为可运行的程序。你必须熟练掌握嵌套条件和循环计数器，包括差一错误（off-by-one errors）。例如，一个应该运行 10 次的循环使用 counter < 10 会在 10 次迭代后停止，而使用 counter <= 10 会运行 11 次。
When tracing nested loops, pay attention to the order in which variables update. The inner loop completes all its iterations for each pass of the outer loop. Questions may ask you to state the final value of a variable or the number of times a print statement executes.
跟踪嵌套循环时，要注意变量更新的顺序。内层循环在外层循环的每一遍中完成它的所有迭代。题目可能要求你写出变量的最终值或打印语句执行的次数。
2. Data Types and Variables | 数据类型与变量
Variables must be declared with an appropriate data type: integer, real/float, Boolean, character and string. Strong typing helps prevent invalid operations and makes code more readable. Choosing the correct type also affects memory usage and arithmetic behaviour.
变量必须以合适的数据类型声明：整型、实型/浮点型、布尔型、字符型和字符串型。强类型有助于防止无效操作，并使代码更易读。选择正确的类型还会影响内存使用和算术行为。
Type coercion and casting are common pitfalls. For example, dividing two integers in some languages truncates the result, while casting to float preserves the decimal part. You should know how to explicitly convert between types using functions like int(), float() and str().
类型强制转换和显式转换是常见陷阱。例如，在某些语言中两个整数相除会截断结果，而转换为浮点型则保留小数部分。你应该知道如何使用 int()、float() 和 str() 等函数在类型之间显式转换。
Constants are named values that do not change during program execution. They improve readability and maintainability. For instance, declaring TAX_RATE = 0.2 is clearer than using the literal 0.2 throughout the code, and it makes updates easier.
常量是在程序执行期间不改变的有名称的值。它们提高了可读性和可维护性。例如，声明 TAX_RATE = 0.2 比在整个代码中使用字面量 0.2 更清晰，并且使更新更容易。
3. Arrays, Lists and Records | 数组、列表与记录
Arrays store multiple values of the same type in contiguous memory locations, accessed by an index starting at 0 or 1 depending on the language. Lists are dynamic and can grow or shrink at runtime. In pseudocode, you may see array indices written as arr[0], arr[1] and so on.
数组在连续内存位置中存储相同类型的多个值，通过索引访问，索引从 0 或 1 开始取决于语言。列表是动态的，可以在运行时增长或缩小。在伪代码中，你可能看到数组索引写作 arr[0]、arr[1] 等。
Records (or structs) group fields of different types under one name. A record for a student might contain a string name, an integer age and a float average mark. You can create an array of records to store data for many students, and then access fields using dot notation such as student.name.
记录（或结构体）将不同类型的字段组合在一个名称下。一个学生的记录可能包含字符串姓名、整型年龄和浮点型平均分。你可以创建一个记录数组来存储许多学生的数据，然后使用点符号（如 student.name）访问字段。
Two-dimensional arrays are useful for representing grids, tables and matrices. You must be able to read from and write to a cell using row and column indices, for example grid[2][3]. Trace questions often involve nested loops iterating over each row and column.
二维数组用于表示网格、表格和矩阵。你必须能够使用行索引和列索引读取和写入单元格，例如 grid[2][3]。跟踪题通常涉及遍历每一行和每一列的嵌套循环。
4. Functions and Procedures | 函数与过程
Functions return a value, while procedures (or subroutines) perform a task without returning a value. Parameters can be passed by value or by reference. Using functions and procedures breaks a large problem into smaller, reusable modules.
函数返回一个值，而过程（或子程序）执行任务但不返回值。参数可以按值传递或按引用传递。使用函数和过程将大问题分解为更小、可复用的模块。
Passing by value copies the argument, so the original variable is unchanged. Passing by reference allows the function to modify the caller’s variable, which is useful for returning multiple results. In Edexcel pseudocode, parameters are usually passed by value unless otherwise stated.
按值传递复制实参，因此原始变量不变。按引用传递允许函数修改调用者的变量，这在需要返回多个结果时很有用。在 Edexcel 伪代码中，参数通常按值传递，除非另有说明。
Local variables exist only within a function or procedure and are destroyed when it returns. Global variables are accessible throughout the program but can make debugging harder. You should understand the scope of a variable and how it affects side effects and state.
局部变量仅存在于函数或过程内部，并在返回时销毁。全局变量在整个程序中可访问，但会使调试更困难。你应该理解变量的作用域及其对副作用和状态的影响。
5. Recursion and The Call Stack | 递归与调用栈
Recursion is a technique where a function calls itself until a base case is reached. Classic examples include factorial n! = n × (n-1)! and Fibonacci numbers. A recursive function must have at least one base case to stop the chain of calls.
递归是一种函数调用自身直到达到基准情形的技术。经典例子包括阶乘 n! = n × (n-1)! 和斐波那契数列。递归函数必须至少有一个基准情形来停止调用链。
Each recursive call is placed on the call stack, storing parameters, local variables and the return address. If the base case is missing or unreachable, a stack overflow occurs. Understanding the call stack helps you trace recursive functions in exam questions.
每个递归调用都被放入调用栈，存储参数、局部变量和返回地址。如果缺少基准情形或无法达到，就会发生栈溢出。理解调用栈有助于你在考试题中跟踪递归函数。
Recursion can be elegant but may be less efficient than iteration because of the overhead of stack frames. Some problems, such as tree traversal, are naturally recursive, while others can be solved clearly with loops. Edexcel expects you to compare both approaches.
递归可能很优雅，但由于栈帧的开销，可能比迭代效率低。有些问题（如树遍历）天然适合递归，而其他问题可以用循环清晰地解决。Edexcel 期望你能够比较这两种方法。
n! = n × (n – 1)! for n > 1, with 1! = 1
6. Searching and Sorting Algorithms | 搜索与排序算法
Linear search checks each element in turn and works on unsorted data. Binary search repeatedly halves a sorted array, achieving O(log n) time complexity. You must be able to trace both algorithms and state the number of comparisons made.
线性搜索依次检查每个元素，适用于未排序数据。二分搜索不断将有序数组对半分割，实现 O(log n) 时间复杂度。你必须能够跟踪这两种算法并说明比较次数。
Common sorting algorithms include bubble sort, insertion sort and merge sort. Bubble sort compares adjacent items and swaps them if needed; merge sort divides the list and merges sorted halves. Edexcel may ask you to complete a pass of bubble sort or list the steps of a merge.
常见排序算法包括冒泡排序、插入排序和归并排序。冒泡排序比较相邻项并在需要时交换；归并排序将列表分割后合并已排序的两半。Edexcel 可能要求你完成一趟冒泡排序或列出归并的步骤。
| Algorithm | Best | Average | Worst | Stable? |
|---|---|---|---|---|
| Bubble sort | O(n) | O(n²) | O(n²) | Yes |
| Insertion sort | O(n) | O(n²) | O(n²) | Yes |
| Merge sort | O(n log n) | O(n log n) | O(n log n) | Yes |
mid = (low + high) ÷ 2 (integer division for binary search)
7. Object-Oriented Programming Essentials | 面向对象编程基础
OOP models real-world entities using classes and objects. A class is a blueprint, while an object is an instance with attributes (fields) and methods. For example, a Car class might have attributes make and speed, and methods accelerate() and brake().
面向对象编程使用类和对象对现实世界实体建模。类是蓝图，而对象是具有属性（字段）和方法（函数）的实例。例如，Car 类可能有属性 make 和 speed，以及方法 accelerate() 和 brake()。
Encapsulation hides internal state and exposes a public interface. Attributes are often declared private and accessed through getter and setter methods. This protects data from invalid changes and makes the class easier to maintain.
封装隐藏内部状态并暴露公共接口。属性通常声明为私有，并通过 getter 和 setter 方法访问。这可以防止无效更改，并使类更易于维护。
Inheritance allows a subclass to reuse and extend a superclass, while polymorphism lets different classes respond to the same method call in their own way. Edexcel questions may ask you to identify the relationship between classes in a UML diagram or code snippet.
继承允许子类复用和扩展父类，而多态让不同类以各自的方式响应同一方法调用。Edexcel 题目可能要求你识别 UML 图或代码片段中类之间的关系。
8. File Handling and Exceptions | 文件处理与异常
Programs often read from and write to text or binary files. Common operations are open, read, write, append and close; closing a file flushes buffers and releases resources. You should know the difference between overwriting a file and appending to the end.
程序经常读写文本文件或二进制文件。常见操作有打开、读取、写入、追加和关闭；关闭文件会刷新缓冲区并释放资源。你应该知道覆盖文件与在末尾追加之间的区别。
Exceptions handle runtime errors such as file not found, division by zero or invalid user input. A try-except block lets the program recover gracefully instead of crashing. For example, you can catch a FileNotFoundError and prompt the user to enter a valid filename.
异常处理用于处理运行时错误，如文件未找到、除以零或无效用户输入。try-except 块让程序优雅地恢复，而不是崩溃。例如，你可以捕获 FileNotFoundError 并提示用户输入有效的文件名。
Using a finally block ensures that cleanup code runs whether an exception occurred or not. This is especially useful for closing files or database connections. Exam questions sometimes ask you to complete a try-except-finally structure.
使用 finally 块可以确保无论是否发生异常，清理代码都会运行。这对于关闭文件或数据库连接特别有用。考试题有时要求你
Published by TutorHao | A-Level 编程 Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导