📚 Programming Paradigms & Data Structures for Edexcel A-Level Programming | Edexcel A-Level 编程：编程范式与数据结构核心
Edexcel A-Level programming requires more than writing code; it assesses how you choose a paradigm, model data, and evaluate algorithms. This revision guide covers the core ideas behind procedural and object-oriented programming, recursion, essential data structures, searching, sorting, and Big O notation. Use it alongside past paper questions from the Pearson ActiveLearn resources to strengthen exam technique.
Edexcel A-Level 编程远不止编写代码，它考查你如何选择编程范式、如何为数据建模以及如何评估算法。本复习指南涵盖过程式与面向对象编程、递归、核心数据结构、搜索、排序以及大 O 复杂度表示法。请结合 Pearson ActiveLearn 资源中的历年真题使用，以提升考试技巧。
1. Programming Paradigms Overview | 编程范式概览
A programming paradigm is a style or way of thinking about how to structure a program. Edexcel expects you to compare procedural, object-oriented, and declarative approaches, and to justify choices in problem-solving scenarios. The paradigm affects readability, reusability, and how state is managed.
编程范式是一种结构化程序的风格或思维方式。Edexcel 要求你比较过程式、面向对象和声明式方法，并在问题求解场景中为选择提供理由。范式会影响代码的可读性、可重用性以及状态的管理方式。
In an exam answer, avoid simply stating a definition. Link the paradigm to a concrete context, such as modelling a bank account or processing sensor data, and explain why that choice reduces complexity.
在考试答案中，不要只给出定义。要把范式与具体情境联系起来，例如为银行账户建模或处理传感器数据，并解释为什么这种选择能降低复杂性。
2. Procedural Programming | 过程式编程
Procedural programming decomposes a task into procedures or functions that operate on explicit data passed as arguments. State is often held in variables outside the functions, and sequencing, selection, and iteration are the fundamental control structures. Examples include Python scripts with functions, C programs, and many exam-style algorithm questions.
过程式编程把任务分解成过程或函数，函数对作为参数传入的明确数据进行操作。状态通常保存在函数外部的变量中，顺序、选择和迭代是基本的控制结构。示例包括带函数的 Python 脚本、C 程序以及许多考试风格的算法题。
Its strengths are simplicity and direct mapping to pseudocode. Its weakness is that shared global state can lead to unexpected side effects as a program grows. In Edexcel questions, you may be asked to trace a procedural algorithm or write pseudocode using definite and indefinite loops.
它的优点是简单，并且能直接映射到伪代码。缺点是随着程序变大，共享全局状态可能导致意外的副作用。在 Edexcel 题目中，你可能需要跟踪一个过程式算法，或使用计数循环和条件循环编写伪代码。
3. Object-Oriented Programming | 面向对象编程
Object-oriented programming (OOP) organises code around objects that combine data (attributes) and behaviour (methods). Key concepts are encapsulation, inheritance, polymorphism, and abstraction. A class is a blueprint, while an object is an instance with its own state.
面向对象编程围绕对象组织代码，对象将数据（属性）和行为（方法）结合在一起。关键概念包括封装、继承、多态和抽象。类是蓝图，对象是具有自身状态的实例。
For Edexcel, you should be able to identify these concepts in short code extracts and explain how encapsulation protects data by restricting direct access to attributes, often using private fields and public methods.
对 Edexcel 考试而言，你应该能在简短代码片段中识别这些概念，并解释封装如何通过限制对属性的直接访问来保护数据，通常使用私有字段和公有方法。
4. Recursion | 递归
Recursion is a technique where a function calls itself with a smaller or simpler input until it reaches a base case. Every recursive solution must have a base case to stop the recursion and a general case that moves towards it. Recursion often provides elegant code but can consume more stack memory than iteration.
递归是一种函数使用更小或更简单的输入调用自身，直到达到基本情况的技术。每个递归解都必须有一个停止递归的基本情况，以及一个向基本情况推进的一般情况。递归通常能提供简洁的代码，但可能比迭代消耗更多栈内存。
Common exam examples include factorial, Fibonacci, binary search, and traversing tree nodes. When asked to trace recursion, draw a call stack and record each return value; this shows the examiner you understand how execution unwinds.
常见的考试示例包括阶乘、斐波那契数列、二分搜索和树节点遍历。当要求跟踪递归时，请画出调用栈并记录每个返回值；这向考官表明你理解执行如何回溯。
5. Arrays and Lists | 数组与列表
Arrays are fixed-size, contiguous collections of elements of the same data type, allowing O(1) access by index. Dynamic lists, such as Python lists or Java ArrayLists, can grow and shrink, which makes them convenient but may involve hidden resizing costs.
数组是固定大小、连续存放且元素类型相同的集合，可通过索引实现 O(1) 访问。动态列表（如 Python 列表或 Java ArrayList）可以增长和缩小，使用方便，但可能涉及隐藏的扩容成本。
Edexcel questions often ask you to manipulate an array using pseudocode, for example finding the largest value, summing elements, or shifting items when inserting at a given position. Be clear about zero-based and one-based indexing conventions in the question.
Edexcel 题目经常要求你用伪代码操作数组，例如查找最大值、对元素求和，或在指定位置插入时移动元素。务必要清楚题目使用的是从 0 开始还是从 1 开始的索引约定。
6. Stacks and Queues | 栈与队列
A stack is a last-in-first-out (LIFO) structure with push and pop operations. A queue is first-in-first-out (FIFO) with enqueue and dequeue operations. Both can be implemented using arrays or linked lists, and both are useful for managing order during computation.
栈是一种后进先出结构，具有 push（压入）和 pop（弹出）操作。队列是一种先进先出结构，具有 enqueue（入队）和 dequeue（出队）操作。两者都可以用数组或链表实现，并且在计算过程中管理顺序时很有用。
Typical applications include call stacks for recursion, undo history, printer jobs, and breadth-first search. When tracing operations, show the contents of the structure after every operation and state whether the operation is allowed or causes underflow.
典型应用包括递归调用栈、撤销历史、打印任务和广度优先搜索。在跟踪操作时，要显示每次操作后的结构内容，并说明该操作是否允许或导致下溢。
7. Trees and Binary Trees | 树与二叉树
A tree is a hierarchical data structure made of nodes connected by edges. A binary tree has at most two children per node, called left and right. Binary search trees maintain the property that left subtree values are smaller and right subtree values are larger, enabling efficient lookup.
树是由节点和边组成的层次数据结构。二叉树每个节点最多有两个子节点，分别称为左子节点和右子节点。二叉搜索树保持左子树值较小、右子树值较大的性质，从而实现高效查找。
You should be able to add nodes, search for a value, and perform pre-order, in-order, and post-order traversal. In-order traversal of a binary search tree outputs values in ascending order, a common exam result worth memorising.
你应该能够添加节点、搜索值，并执行前序、中序和后序遍历。二叉搜索树的中序遍历会按升序输出值，这是一个值得记住的常见考试结论。
8. Hash Tables | 哈希表
A hash table stores key-value pairs and uses a hash function to compute an index for each key. This provides average-case O(1) insertion, deletion, and lookup, much faster than linear search on an array. However, collisions occur when two keys map to the same index.
哈希表存储键值对，并使用哈希函数为每个键计算索引。这提供了平均情况 O(1) 的插入、删除和查找，远快于数组上的线性搜索。但是，当两个键映射到同一个索引时会发生冲突。
Collision resolution techniques include chaining, where each index holds a list of entries, and open addressing, where an alternative slot is found. Exam answers should mention that a good hash function distributes keys evenly to minimise collisions.
冲突解决技术包括链地址法（每个索引存放一个条目列表）和开放寻址法（寻找替代位置）。考试答案应提到，好的哈希函数会均匀分布键，以尽量减少冲突。
9. Search Algorithms | 搜索算法
Linear search checks each element in order and is O(n) in the worst case. It works on unsorted data and is simple to implement. Binary search requires a sorted collection and repeatedly divides the search interval in half, giving O(log n) time.
线性搜索按顺序检查每个元素，最坏情况下为 O(n)。它适用于未排序的数据，并且实现简单。二分搜索要求集合已排序，并反复将搜索区间一分为二，时间复杂度为 O(log n)。
When comparing algorithms, mention both time and space complexity. For example, binary search is faster but requires sorted data and indexed access, while linear search is slower but works on any list.
比较算法时，要同时提到时间复杂度和空间复杂度。例如，二分搜索更快，但需要排序数据和索引访问；线性搜索较慢，但适用于任何列表。
10. Sorting Algorithms | 排序算法
Bubble sort repeatedly compares adjacent pairs and swaps them if out of order. It is simple but has O(n²) average and worst-case time. Insertion sort builds a sorted portion by inserting each new element into its correct position, also O(n²) but efficient for nearly sorted data.
冒泡排序反复比较相邻元素，如果顺序错误则交换。它简单，但平均和最坏时间复杂度为 O(n²)。插入排序通过将每个新元素插入到正确位置来构建已排序部分，时间复杂度也是 O(n²)，但对几乎有序的数据效率较高。
Merge sort and quicksort achieve O(n log n) in typical cases. Merge sort divides the list, recursively sorts each half, and merges them; it is stable and has predictable performance but uses extra memory. Quicksort partitions around a pivot and is often faster in practice but can degrade to O(n²) with poor pivots.
归并排序和快速排序在典型情况下达到 O(n log n)。归并排序将列表分成两半，递归排序每一半，然后合并；它稳定且性能可预测，但需要额外内存。快速排序围绕基准值分区，通常实践中更快，但基准值选择不佳时可能退化到 O(n²)。
11. Algorithm Evaluation and Big O Notation | 算法评估与大 O 表示法
Big O notation describes the upper bound of an algorithm's time or space usage as input size n grows. Common classes are O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ). Constant factors and lower-order terms are ignored.
大 O 表示法描述随着输入规模 n 增大，算法时间或空间使用的上界。常见类别包括 O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。常数因子和低阶项被忽略。
When justifying an answer, identify the dominant operation, count how many times it runs, and express the result in Big O. For example, a nested loop over an array of n items gives O(n²) because each of n outer iterations runs n inner iterations.
在论证答案时，要找出主导操作，计算它执行的次数，并用大 O 表示结果。例如，对 n 个元素的数组使用嵌套循环会得到 O(n²)，因为 n 次外层迭代每次都要执行 n 次内层迭代。
12. Common Exam Pitfalls | 常见考试陷阱
Many students lose marks by confusing a class with an object, forgetting the base case in recursion, or using incorrect indexing in array questions. Others describe an algorithm without evaluating its time complexity, even when the question asks for a comparison.
许多学生因混淆类和对象、在递归中忘记基本情况，或在数组题中使用错误索引而失分。还有学生只描述算法而不评估其时间复杂度，即使题目要求比较。
Before moving on, check whether your pseudocode handles edge cases: empty structures, single-element lists, duplicate keys, and full stacks or queues. Use meaningful variable names and state assumptions explicitly.
继续作答之前，检查你的伪代码是否处理了边缘情况：空结构、单元素列表、重复键，以及满栈或满队列。使用有意义的变量名，并明确陈述假设。
Finally, always relate your answers back to the scenario in the question. A generic answer about OOP or sorting is rarely enough for top-band marks; the examiner wants justification rooted in the problem context.
最后，始终将答案与题目中的场景联系起来。关于面向对象或排序的通用回答通常不足以获得高分；考官希望看到基于问题情境的合理证明。
Published by TutorHao | Programming Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图