📚 Edexcel A-Level Programming: Core Constructs and Algorithms | Edexcel A-Level 编程：核心结构与算法
This revision guide covers the essential programming knowledge required for the Edexcel A-Level Computer Science specification. It focuses on core programming constructs, data structures, subroutines, recursion, file handling, searching and sorting algorithms, complexity analysis, and exam techniques.
本复习指南涵盖 Edexcel A-Level 计算机科学考试大纲所要求的核心编程知识。重点包括编程基本结构、数据结构、子程序、递归、文件处理、搜索与排序算法、复杂度分析以及考试技巧。
1. Programming Paradigms and Structure | 编程范式与程序结构
Programming paradigms are fundamental styles of programming. The two most relevant to Edexcel A-Level are procedural programming and object-oriented programming. Procedural programming organises code into procedures or functions that operate on data, while object-oriented programming bundles data and methods into objects.
编程范式是编程的基本风格。与 Edexcel A-Level 最相关的两种范式是面向过程编程和面向对象编程。面向过程编程将代码组织为操作数据的过程或函数，而面向对象编程将数据和方法封装在对象中。
A well-structured program is modular, with each module performing a single clear task. This improves readability, maintainability, and testability. You should be able to write pseudocode that follows a logical top-down design.
结构良好的程序是模块化的，每个模块执行单一明确的任务。这提高了可读性、可维护性和可测试性。你应该能够编写遵循逻辑自顶向下设计的伪代码。
2. Data Types and Variables | 数据类型与变量
Data types define what kind of value a variable can hold. Common primitive types include integer, real, Boolean, character, and string. Choosing the correct data type affects memory usage and the operations that can be performed.
数据类型定义变量可以保存何种值。常见的基本类型包括整数、实数、布尔型、字符和字符串。选择正确的数据类型会影响内存使用以及可执行的操作。
A variable is a named memory location whose value can change during execution. A constant is similar but its value cannot be modified after initialisation. You must understand variable scope, including local and global variables.
变量是一个命名的内存位置，其值在执行期间可以改变。常量类似，但初始化后其值不可修改。你必须理解变量的作用域，包括局部变量和全局变量。
3. Sequence, Selection, and Iteration | 顺序、选择与迭代
All procedural programs are built from three basic control structures: sequence, selection, and iteration. Sequence means statements are executed in the order written. Selection allows branching based on conditions, using IF, ELSE IF, ELSE, and CASE statements.
所有面向过程的程序都由三种基本控制结构构建：顺序、选择和迭代。顺序意味着语句按编写的顺序执行。选择允许根据条件进行分支，使用 IF、ELSE IF、ELSE 和 CASE 语句。
Iteration repeats a block of code. Definite iteration, such as a FOR loop, runs a known number of times. Indefinite iteration, such as a WHILE or REPEAT UNTIL loop, continues until a condition is met. Infinite loops occur when the termination condition is never satisfied.
迭代重复执行代码块。确定迭代（如 FOR 循环）运行已知次数。不确定迭代（如 WHILE 或 REPEAT UNTIL 循环）持续到满足条件为止。当终止条件永远不满足时，就会发生无限循环。
4. Arrays and Lists | 数组与列表
Arrays and lists store multiple values under one identifier. A one-dimensional array is a fixed-size indexed collection, whereas a list is often dynamic and supports insertion and deletion. A two-dimensional array can model a table or grid.
数组和列表在一个标识符下存储多个值。一维数组是固定大小的索引集合，而列表通常是动态的，支持插入和删除。二维数组可以模拟表格或网格。
When manipulating arrays, you must be careful with index bounds. Many languages use zero-based indexing, so the first element is at index 0. Accessing an out-of-range index causes a runtime error.
操作数组时，必须注意索引边界。许多语言使用从零开始的索引，因此第一个元素位于索引 0。访问越界索引会导致运行时错误。
5. Subroutines: Procedures and Functions | 子程序：过程与函数
A subroutine is a named block of code that can be called from elsewhere in the program. Procedures perform a task but do not return a value. Functions perform a task and return a value to the caller.
子程序是一段命名代码块，可以从程序的其他位置调用。过程执行任务但不返回值。函数执行任务并向调用者返回一个值。
Parameters allow data to be passed into subroutines. Passing by value copies the argument, while passing by reference passes the memory address, allowing changes to affect the original variable. Return values are produced using a RETURN statement.
参数允许将数据传入子程序。按值传递会复制实参，而按引用传递传递内存地址，允许更改影响原始变量。返回值使用 RETURN 语句产生。
6. Recursion | 递归
Recursion is a technique where a subroutine calls itself to solve a smaller instance of the same problem. Every recursive algorithm must have a base case that stops the recursion and a recursive case that reduces the problem size.
递归是一种子程序调用自身来解决同一问题的较小实例的技术。每个递归算法必须有一个停止递归的基准情况，以及一个减小问题规模的递归情况。
A classic example is the factorial function: factorial(n) = n × factorial(n – 1) with factorial(1) = 1 as the base case. Recursion can be elegant but may use more memory due to the call stack.
一个经典示例是阶乘函数：factorial(n) = n × factorial(n – 1)，基准情况为 factorial(1) = 1。递归可能很优雅，但由于调用栈可能会使用更多内存。
7. File Handling and Exception Management | 文件处理与异常管理
Programs often need to read from and write to files. Typical operations include opening a file in read, write, or append mode, reading lines or records, writing data, and closing the file. Always close files to prevent data loss.
程序通常需要读写文件。典型操作包括以读、写或追加模式打开文件，读取行或记录，写入数据以及关闭文件。始终关闭文件以防止数据丢失。
Exceptions are runtime errors that can be handled using TRY, EXCEPT, and FINALLY blocks. Exception handling makes programs more robust by preventing crashes when unexpected input or file errors occur.
异常是可以使用 TRY、EXCEPT 和 FINALLY 块处理的运行时错误。异常处理通过在发生意外输入或文件错误时防止崩溃，使程序更加健壮。
8. Searching Algorithms | 搜索算法
Linear search checks each element in order until the target is found or the end is reached. It works on unsorted data and has a worst-case time complexity of O(n).
线性搜索按顺序检查每个元素，直到找到目标或到达末尾。它适用于未排序的数据，最坏情况时间复杂度为 O(n)。
Binary search repeatedly divides a sorted list in half, comparing the middle element with the target. If the target is smaller, search the left half; if larger, search the right half. It has a time complexity of O(log n) but requires sorted data.
二分搜索反复将有序列表分成两半，将中间元素与目标比较。如果目标较小，搜索左半部分；如果较大，搜索右半部分。其时间复杂度为 O(log n)，但要求数据有序。
9. Sorting Algorithms | 排序算法
Bubble sort repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order. The largest unsorted element ‘bubbles’ to the end each pass. It has average and worst-case complexity O(n²).
冒泡排序反复遍历列表，比较相邻元素，如果顺序错误则交换它们。最大的未排序元素每次遍历都会“冒泡”到末尾。其平均和最坏情况复杂度为 O(n²)。
Merge sort uses a divide-and-conquer approach: split the list into halves recursively, sort each half, then merge the sorted halves. It has a guaranteed time complexity of O(n log n) but uses additional memory.
归并排序使用分治方法：递归地将列表分成两半，对每一半进行排序，然后合并已排序的两半。它的时间复杂度保证为 O(n log n)，但使用额外内存。
10. Algorithm Complexity and Big O Notation | 算法复杂度与大 O 表示法
Big O notation describes the upper bound of an algorithm’s time or space requirements as the input size n grows. Common complexities include O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ).
大 O 表示法描述随着输入规模 n 增长，算法时间或空间需求的上界。常见复杂度包括 O(1)、O(log n)、O(n)、O(n log n)、O(n²) 和 O(2ⁿ)。
Constant time O(1) means runtime does not depend on input size. Linear time O(n) means runtime grows proportionally with input size. Quadratic time O(n²) means doubling input quadruples runtime, which becomes impractical for large data sets.
常数时间 O(1) 意味着运行时间不依赖于输入规模。线性时间 O(n) 意味着运行时间与输入规模成正比增长。二次时间 O(n²) 意味着输入翻倍会使运行时间变为四倍，这对于大数据集变得不切实际。
11. Debugging and Testing | 调试与测试
Debugging is the process of finding and fixing errors in code. Syntax errors occur when the code violates language rules. Logic errors occur when the code runs but produces incorrect results. Runtime errors occur during execution, such as division by zero.
调试是查找并修复代码错误的过程。语法错误在代码违反语言规则时发生。逻辑错误在代码运行但产生错误结果时发生。运行时错误在执行期间发生，例如除以零。
Testing strategies include dry run, trace tables, unit testing, and integration testing. A trace table records variable values at each step, helping you verify that loops and conditions behave as intended.
测试策略包括干运行、跟踪表、单元测试和集成测试。跟踪表记录每一步的变量值，帮助你验证循环和条件按预期运行。
12. Exam Techniques and Pseudocode | 考试技巧与伪代码
In the Edexcel A-Level exam, you may be asked to read, trace, or write pseudocode. Pseudocode should be clear, unambiguous, and use consistent indentation. It does not need to follow the syntax of a specific programming language.
在 Edexcel A-Level 考试中，你可能会被要求阅读、跟踪或编写伪代码。伪代码应当清晰、无歧义，并使用一致的缩进。它不需要遵循特定编程语言的语法。
When designing a solution, break the problem into smaller parts, define inputs and outputs, and identify the control structures needed. Show your working in trace tables and justify your choice of algorithm based on efficiency and data conditions.
设计解决方案时，将问题分解为更小的部分，定义输入和输出，并确定所需的控制结构。在跟踪表中展示工作过程，并根据效率和数据条件证明算法选择的合理性。
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课程辅导，国外大学本科硕士研究生博士课程论文辅导