A-Level Edexcel Programming: Algorithms, Data Structures and Problem Solving | A-Level Edexcel 编程：算法、数据结构与问题求解

📚 A-Level Edexcel Programming: Algorithms, Data Structures and Problem Solving | A-Level Edexcel 编程：算法、数据结构与问题求解

Programming at A-Level is not just about writing code; it is about solving problems, choosing the right data structures, and predicting how algorithms behave. This revision guide covers the core programming concepts required by the Edexcel specification, from abstraction and recursion to searching, sorting, and complexity.

在 A-Level 阶段，编程不仅仅是写代码，更是解决问题、选择合适的数据结构以及预测算法的行为。本复习指南涵盖 Edexcel 考试大纲要求的核心编程概念，从抽象与递归到搜索、排序和复杂度分析。

1. Computational Thinking and Abstraction | 计算思维与抽象

Computational thinking involves decomposition, pattern recognition, abstraction, and algorithm design. Abstraction means removing unnecessary detail so that a complex problem can be represented at a manageable level.

计算思维包括分解、模式识别、抽象和算法设计。抽象意味着去除不必要的细节，使复杂问题可以在可管理的层次上进行表示。

For example, a GPS route planner abstracts roads into nodes and edges, ignoring weather, traffic lights, and driver preferences until a later stage of refinement.

例如，GPS 路径规划器将道路抽象为节点和边，在细化阶段之前忽略天气、红绿灯和司机偏好。

• Decomposition: Break a problem into smaller, manageable sub-problems.

  分解：将问题拆分为更小、更易管理的子问题。

• Pattern recognition: Identify similarities with known problems to reuse solutions.

  模式识别：识别与已知问题的相似性以复用解决方案。

• Abstraction: Focus on essential features and suppress irrelevant detail.

  抽象：关注基本特征并抑制无关细节。

2. Programming Constructs: Sequence, Selection, Iteration | 编程结构：顺序、选择、迭代

All procedural programs are built from three fundamental constructs: sequence (statements executed in order), selection (if, else if, else, switch/case), and iteration (for, while, do-while loops).

所有过程式程序都由三种基本结构构建：顺序（按顺序执行的语句）、选择（if、else if、else、switch/case）和迭代（for、while、do-while 循环）。

Selection uses Boolean conditions such as score >= 80 to choose one branch. Iteration repeats a block while a condition is true or for a known number of steps.

选择使用布尔条件（如 score >= 80）来选择分支。迭代在条件为真或给定步数的情况下重复执行代码块。

These constructs support structured programming, which avoids unstructured jumps such as goto and makes code easier to trace and test.

这些结构支持结构化编程，避免使用无结构的跳转（如 goto），使代码更易于追踪和测试。

3. Subroutines, Functions and Parameters | 子程序、函数与参数

A subroutine is a named block of code that can be reused. Functions return a value; procedures perform actions without returning a value. Parameters pass data into subroutines, enabling generality.

子程序是可复用的命名代码块。函数返回值；过程执行操作而不返回值。参数将数据传入子程序，使其具有通用性。

Parameters may be passed by value (a copy is made) or by reference (the original memory location is used). In many high-level languages, primitive types are passed by value, whereas objects and lists are often passed by reference.

参数可以按值传递（创建副本）或按引用传递（使用原始内存位置）。在许多高级语言中，原始类型按值传递，而对象和列表通常按引用传递。

Local variables declared inside a subroutine have local scope, while global variables can be accessed throughout the program. Excessive use of global variables can make debugging harder.

在子程序内部声明的局部变量具有局部作用域，而全局变量可以在整个程序中访问。过度使用全局变量会增加调试难度。

4. Recursion and Base Cases | 递归与基准情形

Recursion occurs when a subroutine calls itself to solve smaller instances of the same problem. Every recursive algorithm must have at least one base case that stops the recursion, otherwise a stack overflow occurs.

当子

Published by TutorHao | A-Level 编程 Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）