📚 A-Level Edexcel Programming: Core Algorithms, Data Structures and OOP | A-Level Edexcel 编程：核心算法、数据结构与面向对象
This revision guide covers the programming skills and theoretical knowledge required for the Edexcel A-Level Computer Science specification. It explains computational thinking, data types, control structures, recursion, data structures, searching and sorting, algorithm efficiency, object-oriented programming, and testing. Each section is designed to help you produce clear, exam-ready answers and to avoid common mistakes.
本复习指南涵盖 Edexcel A-Level 计算机科学大纲要求的编程技能与理论知识。内容包括计算思维、数据类型、控制结构、递归、数据结构、查找与排序、算法效率、面向对象编程以及测试。每一节都旨在帮助你写出清晰、符合考试要求的答案并避免常见错误。
1. Computational Thinking and Programming Fundamentals | 计算思维与编程基础
Computational thinking involves decomposition, pattern recognition, abstraction, and algorithm design. In Edexcel examinations, candidates must be able to break a problem into manageable sub-problems, identify repeated patterns, hide unnecessary detail, and design step-by-step solutions before writing code.
计算思维包括分解、模式识别、抽象和算法设计。在 Edexcel 考试中，考生必须能够将问题拆分为可管理的子问题，识别重复模式，隐藏不必要的细节，并在编写代码之前设计分步解决方案。
Pseudocode and trace tables are examinable skills. You should write algorithms using assignment (←), selection (IF…THEN…ELSE), iteration (FOR, WHILE, REPEAT…UNTIL), and arrays. A trace table records variable values line by line to verify that the logic is correct.
伪代码和跟踪表是考试必备技能。你应该使用赋值（←）、选择（IF…THEN…ELSE）、迭代（FOR、WHILE、REPEAT…UNTIL）和数组来编写算法。跟踪表逐行记录变量值，以验证逻辑是否正确。
2. Data Types, Variables and Constants | 数据类型、变量与常量
Programming languages distinguish primitive data types such as integer, real/float, Boolean, character, and string. A variable is a named storage location whose value can change during execution, while a constant is fixed at compile time and cannot be modified. Choosing the correct type affects memory usage and precision.
编程语言将基本数据类型区分为整数、实数/浮点数、布尔值、字符和字符串。变量是一个有名称的存储位置，其值在执行过程中可以改变；常量则在编译时固定，运行期间不可修改。选择正确的数据类型会影响内存使用和精度。
Type casting and string manipulation appear frequently in exam questions. For example, converting a string ‘123’ to an integer may use int(‘123’) in pseudocode. Operations such as length, substring, concatenation, and character indexing are also commonly tested.
类型转换和字符串操作经常出现在考题中。例如，在伪代码中将字符串 ‘123’ 转换为整数可以使用 int(‘123’)。长度、子串、连接和字符索引等操作也经常被考查。
3. Control Structures: Sequence, Selection, Iteration | 控制结构：顺序、选择与迭代
All algorithms can be built from three control structures: sequence, selection, and iteration. Sequence executes statements in order. Selection uses IF, ELSE IF, ELSE, or CASE/SWITCH to choose between branches. Iteration repeats blocks using count-controlled FOR loops, pre-condition WHILE loops, or post-condition REPEAT…UNTIL loops.
所有算法都可以由三种控制结构构建：顺序、选择和迭代。顺序结构按顺序执行语句。选择结构使用 IF、ELSE IF、ELSE 或 CASE/SWITCH 在不同分支之间进行选择。迭代结构使用计数控制的 FOR 循环、前置条件的 WHILE 循环或后置条件的 REPEAT…UNTIL 循环来重复执行代码块。
Nested structures are particularly important: loops inside loops and conditionals inside loops. Trace tables help you follow execution when counters and Boolean conditions interact. Avoid infinite loops by ensuring that the loop condition eventually becomes false.
嵌套结构尤其重要：循环内的循环以及循环内的条件判断。当计数器和布尔条件相互作用时，跟踪表有助于你跟踪执行过程。通过确保循环条件最终变为假来避免无限循环。
4. Functions, Procedures and Parameter Passing | 函数、过程与参数传递
A function returns a value, whereas a procedure does not. Parameters can be passed by value or by reference. In pass-by-value, a copy is made, so the original argument remains unchanged. In pass-by-reference, the address is passed, so changes affect the original variable. This distinction is regularly assessed.
函数会返回一个值，而过程不会。参数可以按值传递或按引用传递。在按值传递中，系统会创建副本，因此原始参数保持不变。在按引用传递中，传递的是地址，因此对参数的修改会影响原始变量。这一区别经常出现在考试中。
Local and global variables also matter. Local variables exist only within a subroutine, while global variables are accessible throughout the program. Overuse of global variables can cause side effects and make programs harder to debug and maintain.
局部变量和全局变量同样重要。局部变量仅存在于子程序内部，而全局变量在整个程序中均可访问。过度使用全局变量可能导致副作用，使程序更难调试和维护。
5. Recursion and Stack Frames | 递归与栈帧
Recursion is a technique in which a function calls itself. Every recursive algorithm needs a base case that stops the recursion and a recursive case that reduces the problem size. Classic examples include factorial, Fibonacci, binary search, and tree traversals.
递归是一种函数调用自身的技术。每个递归算法都需要一个基准情形来终止递归，以及一个能够缩小问题规模的递归情形。经典例子包括阶乘、斐波那契数列、二分查找和树遍历。
Recursion uses a call stack. Each call creates a stack frame that stores parameters, local variables, and the return address. Too many recursive calls without reaching the base case cause a stack overflow. Iterative solutions can be more memory efficient, but recursion is often clearer for divide-and-conquer problems.
递归使用调用栈。每次调用都会创建一个栈帧，用于存储参数、局部变量和返回地址。如果递归调用过多而未达到基准情形，就会导致栈溢出。迭代解决方案可能更节省内存，但对于分治问题，递归通常更清晰。
6. Data Structures: Arrays, Lists, Stacks, Queues | 数据结构：数组、列表、栈与队列
Arrays store elements of the same type in contiguous memory and allow access by index in O(1) time. Lists are dynamic structures that can grow or shrink. Stacks follow Last In First Out (LIFO) with push and pop operations, while queues follow First In First Out (FIFO) with enqueue and dequeue operations.
数组将相同类型的元素存储在连续内存中，并允许通过索引以 O(1) 时间访问。列表是可以增长或缩小的动态结构。栈遵循后进先出（LIFO）原则，使用 push 和 pop 操作；队列遵循先进先出（FIFO）原则，使用 enqueue 和 dequeue 操作。
Exam questions often ask about static and dynamic data structures. Static structures have a fixed size allocated at compile time, while dynamic structures can change size at run time. Linked lists are dynamic and use nodes with pointers; they allow efficient insertion and deletion but do not support random access.
考试题目经常考查静态与动态数据结构。静态结构在编译时分配固定大小，而动态结构可以在运行时改变大小。链表是动态结构，使用带有指针的节点；它们支持高效的插入和删除，但不支持随机访问。
7. Searching and Sorting Algorithms | 查找与排序算法
Linear search checks each element in turn, runs in O(n) time, and works on unsorted data. Binary search repeatedly halves a sorted list, runs in O(log n) time, but requires random access. Sorting algorithms include bubble sort O(n²), insertion sort O(n²), merge sort O(n log n), and quick sort with average O(n log n) and worst-case O(n²).
线性查找逐个检查元素，时间复杂度为 O(n)，适用于未排序的数据。二分查找反复将有序列表对半分割，时间复杂度为 O(log n)，但需要随机访问。排序算法包括冒泡排序 O(n²)、插入排序 O(n²)、归并排序 O(n log n) 以及快速排序，其平均时间复杂度为 O(n log n)，最坏情况为 O(n²)。
You should be able to trace these algorithms step by step. In bubble sort, adjacent elements are swapped if they are out of order; after each pass, the largest unsorted element bubbles to the end. Merge sort uses divide and conquer: the list is split until single elements remain, and then sorted halves are merged.
你应该能够逐步跟踪这些算法。在冒泡排序中，如果相邻元素顺序错误就交换；每趟结束后，最大的未排序元素会“冒泡”到末尾。归并排序使用分治策略：先将列表拆分到只剩单个元素，再合并已排序的两半。
8. Algorithm Efficiency and Big-O Notation | 算法效率与大 O 表示法
Big-O notation describes the upper bound of an algorithm’s time or space complexity as the input size n grows. Constants and lower-order terms are ignored. Common complexities from best to worst are: O(1), O(log n), O(n), O(n log n), O(n²), O(2ⁿ), and O(n!).
大 O 表示法描述的是随着输入规模 n 增大，算法时间或空间复杂度的上界。常数和低阶项会被忽略。常见复杂度从优到差依次为：O(1)、O(log n)、O(n)、O(n log n)、O(n²)、O(2ⁿ) 和 O(n!)。
Example: T(n) = 3n² + 5n + 10 → T(n) = O(n²)
For example, if T(n) = 3n² + 5n + 10, the n² term dominates as n grows, so the algorithm is recorded as O(n²). Exam questions may ask you to derive complexity from nested loops and recurrence relations.
例如，如果 T(n) = 3n² + 5n + 10，随着 n 增大，n² 项起主导作用，因此该算法记作 O(n²)。考试题可能要求你从嵌套循环和递归关系中推导复杂度。
Nested loops typically multiply iterations. A loop running n times inside another loop running n times gives O(n²). Recursive divide-and-conquer algorithms often obey T(n) = 2T(n/2) + O(n), giving O(n log n). Use these ideas to compare algorithms for large datasets.
嵌套循环通常会将迭代次数相乘。在一个运行 n 次的循环内部再运行一个运行 n 次的循环，时间复杂度为 O(n²)。递归分治算法通常满足 T(n) = 2T(n/2) + O(n)，因此得到 O(n log n)。可以利用这些知识比较大数据集下不同算法的效率。
9. Object-Oriented Programming Concepts | 面向对象编程概念
Object-oriented programming organises code around objects rather than functions. Key concepts include classes, objects, attributes, methods, encapsulation, inheritance, polymorphism, and abstraction. A class is a blueprint, while an object is an instance of a class with its own state.
面向对象编程围绕对象而非函数来组织代码。关键概念包括类、对象、属性、方法、封装、继承、多态和抽象。类是蓝图，而对象是类的实例，拥有自己的状态。
Encapsulation hides internal data and exposes a public interface, improving maintainability. Inheritance allows a subclass to reuse and extend a parent class. Polymorphism lets the same method name behave differently depending on the object type, often through method overriding.
封装隐藏内部数据并公开公共接口，从而提高可维护性。继承允许子类重用并扩展父类。多态使得同一个方法名可以根据对象类型表现出不同行为，通常通过方法重写实现。
Edexcel questions may ask you to design a class diagram or write pseudocode for classes. You should show attributes and methods, constructor, and access modifiers such as private and public. Understand examples like a Vehicle superclass with Car and Bike subclasses.
Edexcel 题目可能要求你设计类图或编写类的伪代码。你应该展示属性和方法、构造函数以及 private 和 public 等访问修饰符。理解 Vehicle 超类与 Car、Bike 子类等示例。
10. Testing, Debugging and IDE Tools | 测试、调试与集成开发环境工具
Testing verifies that a program meets its requirements. Types include unit testing, integration testing, system testing, and acceptance testing. Test data should include normal, boundary, and erroneous values. Boundary testing is especially important because many errors occur at the edges of valid input ranges.
测试用于验证程序是否符合需求。测试类型包括单元测试、集成测试、系统测试和验收测试。测试数据应包含正常值、边界值和错误值。边界测试尤其重要，因为许多
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课程辅导，国外大学本科硕士研究生博士课程论文辅导