📚 Edexcel A-Level Programming: Algorithms, Paradigms and Data Structures | 爱德思A-Level编程：算法、范式与数据结构
Programming is the heart of the Edexcel A-Level Computer Science specification. It requires you to combine computational thinking, precise algorithm design, data structures and clear pseudocode to solve problems. This article revises the core programming topics tested by Edexcel, with practical examples and exam-focused explanations.
编程是爱德思A-Level计算机科学课程的核心。它要求你把计算思维、精确的算法设计、数据结构和清晰的伪代码结合起来解决问题。本文复习爱德思考纲重点考查的编程主题，并配以实例和应试导向的讲解。
1. Computational Thinking and Problem Decomposition | 计算思维与问题分解
Computational thinking is the foundation of Edexcel A-Level Programming. It involves decomposition, pattern recognition, abstraction and algorithm design. Decomposition means breaking a complex problem into smaller, manageable sub-problems. For example, a chess game can be decomposed into move validation, board display, AI opponent and win detection. Pattern recognition identifies similarities between current and past problems, allowing reuse of solutions. Abstraction focuses on relevant details while ignoring unnecessary complexity, such as modelling a student record by name, ID and grades only. Algorithm design then expresses the solution as a precise sequence of steps.
计算思维是爱德思A-Level编程的基础，包括分解、模式识别、抽象和算法设计。分解指把复杂问题拆分为更小、可控的子问题，例如国际象棋可分为走子验证、棋盘显示、AI对手和胜负判定。模式识别找出当前问题与过去问题的相似点，从而复用已有解法。抽象只关注相关细节并忽略无关复杂性，例如用姓名、学号和成绩来建模学生记录。算法设计则把解法表达为精确的步骤序列。
In exam questions, you may be given a real-world scenario and asked to identify the key inputs, processes and outputs before writing pseudocode. A clear decomposition table often earns method marks even if the final algorithm is incomplete.
在考试题目中，你可能会看到一个现实情景，并被要求在编写伪代码前识别关键输入、处理和输出。清晰的问题分解表往往能获得方法分，即使最终算法不完整。
2. Algorithm Design and Pseudocode | 算法设计与伪代码
Edexcel pseudocode uses keywords such as SET, IF … THEN … ELSE … END IF, WHILE … END WHILE, FOR … END FOR and PRINT. Variables are assigned with SET or the left arrow. Input is often shown as INPUT or RECEIVE. When writing pseudocode, keep indentation consistent and make the purpose of each block clear.
爱德思伪代码使用 SET、IF … THEN … ELSE … END IF、WHILE … END WHILE、FOR … END FOR 和 PRINT 等关键字。变量用 SET 或左箭头赋值，输入常用 INPUT 或 RECEIVE。写伪代码时，要保持缩进一致，并让每个代码块的意图清晰。
A simple pseudocode example that sums the integers from 1 to 10 is shown below. Notice how the loop variable is initialised and updated explicitly.
下面是一个将 1 到 10 的整数相加的简单伪代码示例。注意循环变量是如何被显式初始化和更新的。
SET total TO 0
FOR i FROM 1 TO 10
SET total TO total + i
END FOR
PRINT total
Examiners value clarity over cleverness. Always name variables meaningfully, avoid infinite loops by updating loop counters, and use consistent indentation. If a function is required, include its parameters and a RETURN statement.
考官重视清晰性胜过技巧性。变量命名要有意义，避免无限循环要更新循环计数器，并保持一致的缩进。如果题目要求写函数，要包含参数和 RETURN 语句。
3. Programming Paradigms: Procedural and Object-Oriented | 编程范式：过程式与面向对象
Procedural programming organises code into procedures or functions that operate on data. It follows a top-down design and uses sequence, selection and iteration. Object-oriented programming (OOP) models real-world entities as objects that combine state (attributes) and behaviour (methods). Key OOP concepts tested by Edexcel include encapsulation, inheritance, polymorphism and association.
过程式编程把代码组织为对数据进行操作的过程或函数，采用自顶向下设计，使用顺序、选择和迭代。面向对象编程把现实世界实体建模为对象，对象把状态（属性）和行为（方法）结合。爱德思考纲考查的OOP关键概念包括封装、继承、多态和关联。
Encapsulation hides internal state by making attributes private and exposing public methods. Inheritance allows a subclass to reuse and extend a superclass. Polymorphism enables one interface to behave differently depending on the object type. Association describes how objects interact, such as a Library class containing many Book objects.
封装通过把属性设为私有、暴露公有方法来隐藏内部状态。继承允许子类复用并扩展父类。多态使同一接口能根据对象类型表现不同行为。关联描述对象如何交互，例如一个 Library 类包含多个 Book 对象。
When comparing paradigms, state the benefits of OOP: code reuse through inheritance, easier maintenance through encapsulation, and more natural modelling of real-world systems. Procedural programming can be simpler for small programs and direct algorithmic tasks.
在比较范式时，要说明OOP的好处：通过继承实现代码复用，通过封装使维护更容易，以及对现实系统进行更自然的建模。过程式编程对于小程序和直接算法任务可以更简单。
4. Data Types and Core Data Structures | 数据类型与核心数据结构
Edexcel expects knowledge of primitive data types: integer, real/float, Boolean, character and string. Composite data structures include arrays, lists, records, sets, stacks, queues, trees and hash tables. Arrays store fixed-size ordered elements of the same type and allow direct indexing. Lists are dynamic and allow insertion/deletion at any position. Records group related fields of possibly different types.
爱德思考纲要求掌握基本数据类型：整数、实数/浮点数、布尔、字符和字符串。复合数据结构包括数组、列表、记录、集合、栈、队列、树和哈希表。数组存储固定大小、相同类型的有序元素，支持直接索引。列表是动态的，可在任意位置插入或删除。记录将可能不同类型的相关字段分组。
Stacks follow Last In First Out (LIFO); queues follow First In First Out (FIFO). Trees, especially binary search trees, support efficient search, insertion and deletion. Hash tables provide average-case constant time lookup via a hash function, but can degrade when many collisions occur.
栈遵循后进先出（LIFO）；队列遵循先进先出（FIFO）。树，尤其是二叉搜索树，支持高效搜索、插入和删除。哈希表通过哈希函数提供平均情况下的常数时间查找，但当冲突很多时性能会下降。
You must be able to choose an appropriate data structure for a scenario. For example, a printer queue should use a queue, an undo feature should use a stack, and a phone contact search should use a hash table or binary search tree.
你必须能为情景选择合适的数据结构。例如，打印机队列应使用队列，撤销功能应使用栈，电话联系人搜索应使用哈希表或二叉搜索树。
5. 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 O(n) time complexity. Binary search repeatedly halves a sorted list by comparing the middle element to the target. Its time complexity is O(log n), making it much faster on large sorted lists.
线性搜索依次检查每个元素，直到找到目标或列表结束。它适用于未排序数据，时间复杂度为 O(n)。二分搜索通过将中间元素与目标比较，不断将有序列表折半，时间复杂度为 O(log n)，在大型有序列表上快得多。
In an exam, you must be able to trace both algorithms and state the condition under which each is appropriate. Binary search requires random access and a sorted array; linear search works on any list, including linked lists.
考试中你必须能够跟踪两种算法，并说明各自适用的条件。二分搜索需要随机访问和有序数组；线性搜索适用于任何列表，包括链表。
6. Sorting Algorithms | 排序算法
Bubble sort repeatedly compares adjacent elements and swaps them if they are in the wrong order, pushing the largest element to the end on each pass. Insertion sort builds a sorted sublist by taking each new element and inserting it into its correct position. Merge sort is a divide-and-conquer algorithm that splits the list in half, recursively sorts each half and merges the two sorted halves.
冒泡排序反复比较相邻元素并在顺序错误时交换，每一趟把最大元素推到末尾。插入排序通过取出每个新元素并插入正确位置来构建有序子表。归并排序是一种分治算法，将列表对半拆分，递归排序每一半，再合并两个有序半表。
Edexcel questions often ask for a trace, the number of comparisons or swaps, and the time complexity of each algorithm. The table below summarises the common sorting algorithms and their complexities.
爱德思题目常要求跟踪排序过程、给出比较或交换次数以及每种算法的时间复杂度。下表总结了常见排序算法及其复杂度。
| Algorithm | Best Case | Average Case | Worst Case | Space |
|---|---|---|---|---|
| Bubble sort | O(n) | O(n²) | O(n
Published by TutorHao | A-Level 编程 Revision Series | aleveler.com 更多咨询请联系16621398022（同微信） CommentsMore posts |
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导