📚 Edexcel A-Level Programming: Constructs, Data Structures and Algorithms | Edexcel A-Level 编程：结构、数据结构与算法
Programming is central to the Edexcel A-Level Computer Science specification. This article brings together the core programming constructs, data structures, algorithm design techniques and testing strategies you need to answer programming questions confidently in the exam.
编程是 Edexcel A-Level 计算机科学课程的核心。本文汇总了核心编程结构、数据结构、算法设计技巧和测试策略，帮助你在考试中自信地应对编程题。
1. Programming Constructs: Sequence, Selection, Iteration | 编程基本结构：顺序、选择、迭代
Every program can be built from three fundamental constructs: sequence, selection and iteration. Sequence means statements are executed one after another in the order written. Selection uses IF, ELSE IF, ELSE or CASE statements to make decisions and choose between different branches. Iteration uses FOR, WHILE or REPEAT…UNTIL loops to repeat a block of code.
每个程序都可以由三种基本结构构建：顺序、选择和迭代。顺序意味着语句按书写顺序逐条执行。选择使用 IF、ELSE IF、ELSE 或 CASE 语句做出判断并在不同分支之间选择。迭代使用 FOR、WHILE 或 REPEAT…UNTIL 循环重复执行一段代码。
FOR loops are count-controlled because the number of repetitions is known in advance. WHILE loops are condition-controlled and check the condition before each iteration, so the loop body may never run. REPEAT…UNTIL loops check the condition after each iteration, so the loop body runs at least once.
FOR 循环是计数控制循环，因为重复次数是预先已知的。WHILE 循环是条件控制循环，在每次迭代之前检查条件，因此循环体可能一次也不执行。REPEAT…UNTIL 循环在每次迭代之后检查条件，因此循环体至少执行一次。
2. Subprograms and Recursion | 子程序与递归
A subprogram is a named block of code that can be called from elsewhere in a program. Functions return a value, while procedures perform actions without returning a value. Subprograms support modular design by reducing duplication and making code easier to test and maintain.
子程序是可以在程序其他地方调用的命名代码块。函数会返回一个值，而过程执行动作但不返回值。子程序通过减少重复使代码更易于测试和维护，从而支持模块化设计。
Parameters can be passed by value or by reference. Passing by value copies the argument, so changes inside the subprogram do not affect the original variable. Passing by reference passes the memory address, so changes inside the subprogram directly affect the original variable.
参数可以按值传递或按引用传递。按值传递会复制实际参数，因此子程序内部的改变不会影响原始变量。按引用传递传递的是内存地址，因此子程序内部的改变会直接影响原始变量。
Recursion is a technique where a subprogram calls itself. Every recursive routine must have a base case that stops the recursion and a recursive case that reduces the problem towards the base case. Recursion is elegant but can use more memory because each call adds a stack frame.
递归是一种子程序调用自身的技术。每个递归例程必须有一个停止递归的基准情形，以及一个将问题缩小并向基准情形靠近的递归情形。递归很优雅，但可能占用更多内存，因为每次调用都会添加一个栈帧。
3. Data Types and Variables | 数据类型与变量
Variables are named storage locations whose values can change during program execution. Constants are named values that cannot be changed once assigned. Choosing the correct data type is essential for writing efficient and error-free code.
变量是命名的存储位置，其值在程序执行期间可以改变。常量是赋值后不能更改的命名值。选择正确的数据类型对于编写高效且无错误的代码至关重要。
Common primitive data types include integer for whole numbers, real or float for decimal numbers, Boolean for true or false values, character for a single symbol, and string for a sequence of characters. Edexcel also expects you to understand composite types such as arrays, records and lists.
常见的原始数据类型包括用于整数的 integer、用于小数的 real 或 float、用于真或假值的 Boolean、用于单个符号的 character，以及用于字符序列的 string。Edexcel 还要求你理解数组、记录和列表等复合类型。
Type conversion can be implicit or explicit. Implicit conversion happens automatically when mixing compatible types, while explicit conversion uses functions such as int(), float(), str() or bool() to convert between types.
类型转换可以是隐式的或显式的。隐式转换在混合兼容类型时自动发生，而显式转换使用 int()、float()、str() 或 bool() 等函数在类型之间进行转换。
4. Arrays and Records | 数组与记录
An array is a collection of elements of the same data type stored in contiguous memory locations. Elements are accessed using an index, usually starting at 0. Arrays can be one-dimensional, two-dimensional or multi-dimensional.
数组是存储在连续内存位置中的相同数据类型元素的集合。元素通过索引访问，索引通常从 0 开始。数组可以是一维、二维或多维的。
A record is a data structure that groups data items of possibly different types into one logical unit. Each item in a record is called a field. For example, a Student record might contain fields for name, date of birth, and test score, each with a different data type.
记录是一种将可能不同数据类型的数据项组合成一个逻辑单元的数据结构。记录中的每个数据项称为字段。例如，一个 Student 记录可以包含姓名、出生日期和考试分数等字段，每个字段的数据类型不同。
Static arrays have a fixed size set at compile time, which can waste memory if not fully used. Dynamic arrays can grow or shrink at runtime using heap memory, offering more flexibility but requiring careful memory management.
静态数组在编译时固定大小，如果没有完全使用可能会浪费内存。动态数组可以在运行时使用堆内存增大或缩小，提供更大的灵活性，但需要小心管理内存。
5. Lists, Stacks and Queues | 列表、栈与队列
A list is an abstract data type that stores an ordered sequence of elements. Lists can be implemented using arrays or linked lists. Unlike arrays, lists often provide built-in operations such as append, insert, remove and search.
列表是一种存储有序元素序列的抽象数据类型。列表可以用数组或链表实现。与数组不同，列表通常提供内置操作，例如追加、插入、删除和搜索。
A stack is a last in, first out (LIFO) data structure. The two main operations are push, which adds an item to the top, and pop, which removes and returns the top item. Stacks are used for undo features, expression evaluation and managing recursive calls.
栈是一种后进先出（LIFO）的数据结构。两个主要操作是 push，它向栈顶添加一个元素；以及 pop，它移除并返回栈顶元素。栈用于撤销功能、表达式求值和管理递归调用。
A queue is a first in, first out (FIFO) data structure. Items are added at the rear and removed from the front. Queues are used in scheduling, buffering and managing print jobs. A circular queue reuses freed spaces to avoid wasted memory.
队列是一种先进先出（FIFO）的数据结构。元素在队尾加入，从队头移除。队列用于调度、缓冲和管理打印作业。循环队列通过重用释放的空间来避免内存浪费。
6. Trees and Hash Tables | 树与哈希表
A tree is a hierarchical data structure consisting of nodes. A binary tree has at most two children per node, called the left child and the right child. Trees are used to represent file systems, expression parsing and search structures.
树是由节点组成的分层数据结构。二叉树每个节点最多有两个子节点，称为左孩子和右孩子。树用于表示文件系统、表达式解析和搜索结构。
A binary search tree (BST) keeps keys in order: for every node, all keys in the left subtree are smaller, and all keys in the right subtree are larger. This allows efficient searching, insertion and deletion when the tree is balanced.
二叉搜索树（BST）保持键值有序：对于每个节点，左子树中的所有键值都较小，右子树中的所有键值都较大。当树平衡时，这允许高效的搜索、插入和删除操作。
A hash table stores key-value pairs and uses a hash function to compute an index for each key. A good hash function distributes keys uniformly to reduce collisions. Collisions can be handled by chaining or open addressing.
哈希表存储键值对，并使用哈希函数为每个键计算一个索引。好的哈希函数能将键均匀分布以减少冲突。冲突可以通过链地址法或开放寻址法处理。
7. Searching Algorithms | 搜索算法
Linear search checks each element in turn until the target is found or the list ends. It works on unsorted data and has average and worst-case time complexity O(n).
线性搜索依次检查每个元素，直到找到目标或列表结束。它适用于未排序的数据，平均和最坏情况时间复杂度为 O(n)。
Binary search repeatedly divides a sorted list in half to locate a target. It compares the target with the middle element and discards the half that cannot contain the target. Binary search has time complexity O(log n), making it much faster for large lists.
二分搜索反复将已排序列表分成两半以定位目标。它将目标与中间元素比较，并丢弃不可能包含目标的那一半。二分搜索的时间复杂度为 O(log n)，对于大型列表要快得多。
When choosing a search algorithm, consider whether the data is sorted and how often searches are performed. Linear search is simple and requires no sorting, while binary search needs a sorted array but gives much better performance on large data sets.
选择搜索算法时，要考虑数据是否有序以及搜索执行的频率。线性搜索简单且不需要排序，而二分搜索需要有序数组，但在大数据集上性能要好得多。
8. Sorting Algorithms | 排序算法
Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order. Each pass places the next largest element in its correct position. Bubble sort has average and worst-case time complexity O(n²).
冒泡排序反复比较相邻元素，如果顺序错误就交换它们。每一趟将下一个最大元素放到正确位置。冒泡排序的平均和最坏情况时间复杂度为 O(n²)。
Insertion sort builds the sorted list one element at a time by inserting each new element into its correct position among the previously sorted elements. It works well for small or nearly sorted lists and has average and worst-case complexity O(n²).
插入排序通过将每个新元素插入到先前已排序元素中的正确位置，一次一个元素地构建有序列表。它适用于小型或几乎有序的列表，平均和最坏情况复杂度为 O(n²)。
Merge sort uses divide and conquer: it recursively splits the list into halves, sorts each half, then merges the sorted halves. Merge sort has time complexity O(n log n) in all cases but requires additional memory for merging.
归并排序使用分治法：递归地将列表分成两半，对每一半排序，然后合并两个有序子列表。归并排序在所有情况下时间复杂度都为 O(n log n)，但合并时需要额外内存。
Quicksort also uses divide and conquer by choosing a pivot, partitioning elements into those smaller and larger than the pivot, and recursively sorting the partitions. Its average complexity is O(n log n), but the worst case is O(n²) when a poor pivot is chosen.
快速排序也使用分治法：选择一个枢轴，将元素划分为小于枢轴和大于枢轴的两部分，并递归地对这些分区排序。其平均复杂度为 O(n log n)，但当枢轴选择不佳时最坏情况为 O(n²)。
9. Algorithm Analysis and Big-O Notation | 算法分析与大O表示法
Big-O notation describes the upper bound of an algorithm’s time or space requirements as the input size grows. It focuses on the dominant term and ignores constant factors and lower-order terms.
大O表示法描述算法随着输入规模增长所需时间或空间的上界。它关注主导项，忽略常数因子和低阶项。
O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(2ⁿ)
Constant time O(1) means the algorithm takes the same number of steps regardless of input size. Logarithmic time O(log n) means the problem is divided repeatedly, as in binary search. Linear time O(n) grows directly with input size.
常数时间 O(1) 意味着无论输入大小如何，算法都执行相同的步数。对数时间 O(log n) 意味着问题被反复分割，如二分搜索。线性时间 O(n) 与输入大小成正比增长。
Quadratic time O(n²) often arises from nested loops over the input, such as in bubble sort and insertion sort. Exponential time O(2ⁿ) becomes impractical very quickly as the input size grows, so efficient algorithm design aims for O(n log n) or better.
二次时间 O(n²) 通常由对输入的嵌套循环产生，例如冒泡排序和插入排序。指数时间 O(2ⁿ) 随着输入规模增长会很快变得不可行，因此高效的算法设计力求 O(n log n) 或更优。
10. Object-Oriented Programming Essentials | 面向对象编程基础
Object-oriented programming (OOP) organises code around objects rather than functions. A class is a blueprint that defines attributes and methods. An object is an instance of a class. Inheritance allows a new class to reuse and extend the properties and methods of an existing class.
面向对象编程（OOP）围绕对象而不是函数组织代码。类是定义属性和方法的蓝图。对象是类的实例。继承允许新类重用并扩展现有类的属性和方法。
Encapsulation hides the internal state of an object and only exposes necessary methods. This protects data integrity and reduces unintended interference. Polymorphism allows methods with the same name to behave differently depending on the object calling them.
封装隐藏对象的内部状态，只暴露必要的方法。这保护了数据完整性并减少了意外干扰。多态允许同名方法根据调用它的对象表现出不同的行为。
OOP is especially useful for large programs because it promotes code reuse, modularity and maintainability. However, it can introduce overhead and may be less efficient for very simple scripts compared with procedural programming.
面向对象编程对大型程序特别有用，因为它促进了代码重用、模块化和可维护性。然而，与过程式编程相比，它可能引入额外开销，对于非常简单的脚本可能效率较低。
11. Exception Handling and Testing | 异常处理与测试
Exception handling allows a program to respond gracefully to runtime errors rather than crashing. Try, except and finally blocks catch exceptions, execute recovery code and release resources cleanly. This improves robustness and user experience.
异常处理允许程序优雅地响应运行时错误而不是崩溃。Try、except 和 finally 块捕获异常、执行恢复代码并干净地释放资源。这提高了健壮性和用户体验。
Testing should cover normal, boundary and erroneous data. Normal data tests valid expected inputs. Boundary data tests values at the limits of valid ranges, such as 0 or the maximum allowed. Erroneous data tests invalid inputs to ensure they are rejected or handled correctly.
测试应覆盖正常、边界和错误数据。正常数据测试有效的预期输入。边界数据测试有效范围极限处的值，例如 0 或允许的最大值。错误数据测试无效输入以确保它们被正确拒绝或处理。
White-box testing examines internal logic and paths, using knowledge of the code to select test cases. Black-box testing treats the program as a sealed box and tests inputs and outputs against the specification. Both approaches are needed in a complete test plan.
白盒测试检查内部逻辑和路径，利用对代码的了解来选择测试用例。黑盒测试将程序视为密封的盒子，根据规范测试输入和输出。完整的测试计划需要同时使用这两种方法。
12. Exam Tips for Edexcel Programming Questions | Edexcel 编程题考试技巧
When answering Edexcel programming questions, always read the question carefully and identify whether it asks for writing code, tracing code, describing a concept or correcting an error. Use precise technical terminology such as LIFO, FIFO, recursion and parameter passing.
回答 Edexcel 编程题时，务必仔细阅读题目，判断它是要求写代码、跟踪代码、描述概念还是纠正错误。使用准确的技术术语，例如 LIFO、FIFO、递归和参数传递。
Trace tables are essential for code tracing questions. Record the values of variables line by line, updating them after each instruction. This helps you verify loops, recursion and conditionals without missing a step.
跟踪表对于代码跟踪题至关重要。逐行记录变量的值，并在每条指令之后更新它们。这有助于你验证循环、递归和条件语句而不遗漏任何一步。
For algorithm questions, compare algorithms by their Big-O complexity, stability, memory usage and whether they require sorted data. Be prepared to suggest the most suitable algorithm for a given scenario and justify your choice.
对于算法题，要根据大O复杂度、稳定性、内存使用以及是否需要有序数据来比较算法。准备好针对给定场景建议最合适的算法并说明理由。
Manage your time by outlining pseudocode before writing full code. Use indentation and comments to show your logic clearly. If you cannot complete a solution, write the main steps in pseudocode to gain partial marks.
通过先写出伪代码大纲来管理时间，再编写完整代码。使用缩进和注释清晰展示逻辑。如果无法完成解决方案，用伪代码写出主要步骤以获取部分分数。
Published by TutorHao | Programming Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导Cancel reply