Arrays in A-Level Edexcel Computer Science: Key Exam Points | A-Level Edexcel 计算机：数组考点精讲

📚 Arrays in A-Level Edexcel Computer Science: Key Exam Points | A-Level Edexcel 计算机：数组考点精讲

Arrays form one of the foundational data structures assessed in the Edexcel A-Level Computer Science specification. Mastery of 1D and 2D arrays, their memory representation, and their manipulation using pseudocode is essential for both Paper 1 (Principles of Computer Science) and Paper 2 (Application of Computational Thinking). This article revisits every critical exam point, from static and dynamic arrays to searching and sorting algorithms, equipping you with the precise knowledge and terminology required for top marks.

数组是 Edexcel A-Level 计算机科学考纲中最基础的数据结构之一。掌握一维和二维数组、它们在内存中的表示以及使用伪代码进行操作的技能，对 Paper 1（计算机科学原理）和 Paper 2（计算思维应用）都至关重要。本文涵盖了从静态数组和动态数组到搜索与排序算法的每一个关键考点，帮助你在术语和细节上获得满分。

1. Definition and Key Characteristics | 数组的定义与核心特征

An array is a finite, ordered collection of elements of the same data type, stored contiguously in memory. Each element is accessed via an index, which is typically an integer starting from 0 in most modern languages and pseudocode conventions. This uniformity enables constant-time access to any element.

数组是一个有限、有序且具有相同数据类型的元素集合，在内存中连续存储。每个元素通过索引访问，索引通常是从 0 开始的整数（在大多数现代语言和伪代码惯例中）。这种均一性使得能够以常数时间访问任意元素。

In the Edexcel pseudocode, arrays are declared with a fixed size unless otherwise noted. For example, ARRAY scores[5] OF INTEGER creates a static array that can hold 5 integers. The elements are denoted as scores[0], scores[1], …, scores[4].

在 Edexcel 伪代码中，数组若无特别说明，均以固定大小声明。例如 ARRAY scores[5] OF INTEGER 创建了一个可容纳 5 个整数的静态数组。其元素分别表示为 scores[0]、scores[1]…scores[4]。

2. Static vs Dynamic Arrays | 静态数组与动态数组

Static arrays have a fixed length determined at compile time, and their size cannot be altered during program execution. They are memory-efficient for known data sizes but lack flexibility. A static array declaration in pseudocode might be ARRAY names[100] OF STRING.

静态数组的长度在编译时确定，程序执行期间大小不可改变。它们在已知数据规模时内存效率高，但缺乏灵活性。伪代码中的静态数组声明可以是 ARRAY names[100] OF STRING。

Dynamic arrays, on the other hand, can be resized during runtime. While the Edexcel pseudocode does not explicitly provide a built-in resizing mechanism, exam questions may ask you to describe the concept or to simulate dynamic behaviour using a list or by copying elements into a new array of larger size. Understanding the trade-off between fixed and flexible structures is a typical assessment point.

动态数组则可在运行时调整大小。虽然 Edexcel 伪代码并未显式提供内置的重调大小机制，但考题可能会要求你描述这一概念，或者通过列表、将元素复制到更大的新数组来模拟动态行为。理解固定结构与灵活结构之间的权衡是一个典型考查点。

3. Memory Representation and Address Calculation | 内存表示与地址计算

Elements of a one-dimensional array are stored in consecutive memory locations. Given the base address (B), the size of each element in bytes (S), and the index (i), the address of the i-th element is calculated as:

一维数组的元素存储在连续的内存单元中。给定基地址 B、每个元素的字节大小 S 以及索引 i，第 i 个元素的地址计算如下：

Address = B + i × S

This simple formula underpins the O(1) access time. For a 2D array of dimensions rows × cols stored in row-major order (the most common convention), the address of element (r, c) is:

这一简单公式保证了 O(1) 访问时间。对于按行优先存储（最常见的约定）的 rows × cols 二维数组，元素 (r, c) 的地址为：

Address = B + (r × cols + c) × S

Exam questions occasionally ask you to compute an address, emphasising your understanding of memory layout and index arithmetic.

考题偶尔会要求你计算地址，以考查你对内存布局和索引运算的理解。

4. One-Dimensional Arrays: Traversal and Manipulation | 一维数组：遍历与操作

Traversing a 1D array typically involves a FOR loop from 0 to length-1. Common operations include initialisation, input, output, summation, and searching. For instance, to sum all elements of an array nums of size n:

遍历一维数组通常使用从 0 到 length-1 的 FOR 循环。常见操作包括初始化、输入、输出、求和以及搜索。例如，对长度为 n 的数组 nums 的所有元素求和：

SET total TO 0
FOR i FROM 0 TO n-1 DO
    SET total TO total + nums[i]
END FOR

Be prepared to write pseudocode for finding the minimum/maximum, counting occurrences, or shifting elements left or right. These patterns frequently appear in Paper 2 scenario-based questions.

请准备好编写伪代码来实现查找最小值/最大值、统计出现次数或将元素左移或右移。这些模式经常出现在 Paper 2 的场景题中。

5. Two-Dimensional Arrays and Nested Iteration | 二维数组与嵌套迭代

A 2D array can be visualised as a table with rows and columns. Declaration in Edexcel pseudocode might be ARRAY grid[3][4] OF INTEGER. Accessing an element requires two indices: grid[r][c].

二维数组可以看作具有行和列的表格。Edexcel 伪代码中的声明可以是 ARRAY grid[3][4] OF INTEGER。访问元素需要两个索引：grid[r][c]。

To process every element, use nested loops:

处理所有元素需要使用嵌套循环：

FOR row FROM 0 TO 2 DO
    FOR col FROM 0 TO 3 DO
        OUTPUT grid[row][col]
    END FOR
END FOR

Exam tasks often require row-wise summation, column-wise summation, or diagonal traversals. Always ensure the inner loop processes columns when using row-major order to maximise cache efficiency – a theoretical point that may be examined indirectly through algorithm complexity.

考试任务常要求按行求和、按列求和或对角线遍历。按行优先顺序时，务必确保内层循环处理列，以最大化缓存效率——此理论点可能通过算法复杂度间接考查。

6. Searching Algorithms on Arrays | 数组上的搜索算法

Two searching paradigms dominate the Edexcel specification: linear search and binary search. Both operate on arrays, though binary search requires a sorted array.

Edexcel 考纲中主要有两种搜索范式：线性搜索和二分搜索。两者都作用于数组，但二分搜索要求数组是已排序的。

Linear search iterates through each element sequentially, with a time complexity of O(n). It works on unsorted data. Pseudocode typical of the exam:

线性搜索按顺序遍历每个元素，时间复杂度为 O(n)。它可处理未排序数据。考试中典型的伪代码：

SET found TO FALSE
SET index TO 0
WHILE index < length AND NOT found DO
    IF arr[index] = target THEN
        SET found TO TRUE
    ELSE
        SET index TO index + 1
    END IF
END WHILE

Binary search repeatedly divides the search interval in half, requiring O(log n) time. You must be able to trace and write the algorithm, correctly updating low, high, and mid pointers.

二分搜索反复将搜索区间减半，时间复杂度 O(log n)。你必须能够追踪并编写该算法，正确地更新 low、high 和 mid 指针。

7. Sorting Algorithms Involving Arrays | 涉及数组的排序算法

Bubble sort and insertion sort are the two array-based sorting algorithms explicitly listed. For Edexcel, you need to know their mechanics, pseudocode, and comparative efficiency.

冒泡排序和插入排序是明确列出的两种基于数组的排序算法。对于 Edexcel，你需要了解其机制、伪代码及效率比较。

Bubble sort makes multiple passes, swapping adjacent elements if they are out of order. It is O(n²) in the worst and average cases but can be optimised to stop early if no swaps occur. The inner loop structure must be precise.

冒泡排序进行多趟扫描，若相邻元素顺序错误则交换。最坏和平均情况为 O(n²)，但可通过在无交换时提前终止来优化。内层循环结构必须准确。

Insertion sort builds a sorted sublist one element at a time by shifting elements to make room. It is O(n²) but efficient for small or nearly sorted datasets. Its key operation is the while-loop that shifts elements right.

插入排序通过移动元素腾出空间，一次构建一个元素的已排序子序列。它为 O(n²)，但对小型或近乎有序的数据集效率较高。其关键操作是向右移动元素的 while 循环。

8. Arrays of Records and Structured Data | 记录数组与结构化数据

Edexcel pseudocode allows arrays of records, e.g., ARRAY students[30] OF RECORD {name: STRING, grade: INTEGER}. This combines the concepts of composite data types and arrays. Accessing fields uses dot notation: students[i].name.

Edexcel 伪代码允许使用记录数组，例如 ARRAY students[30] OF RECORD {name: STRING, grade: INTEGER}。这融合了复合数据类型与数组的概念。访问字段使用点表示法：students[i].name。

Algorithms on arrays of records often involve sorting based on a particular field or filtering records that satisfy a condition. For example, outputting all students with a grade above 80 requires a traversal and a conditional statement.

记录数组上的算法经常涉及基于某个字段排序或筛选满足条件的记录。例如，输出所有成绩高于 80 的学生需要遍历和条件判断。

9. Common Exam Traps and Edge Cases | 常见考试陷阱与边界情况

Off-by-one errors are the most frequent mistake. Always confirm whether the upper bound is inclusive and whether the index starts at 0 or 1 (Edexcel pseudocode uses 0‑based indexing). When reading from a file into an array, ensure the data does not exceed the declared size.

差一错误是最常见的错误。务必确认上界是否包含，以及索引从 0 还是 1 开始（Edexcel 伪代码使用基于 0 的索引）。从文件读入数组时，要确保数据不会超出声明的大小。

Additionally, when an algorithm modifies an array (e.g., deleting an element by shifting left), you must define how the length or a sentinel value represents the new logical size. For dynamic-like resizing, always mention creating a new larger array and copying existing elements because pseudocode arrays cannot be resized in place.

此外，当算法修改数组时（例如通过左移删除元素），你必须定义如何用长度或哨兵值表示新的逻辑大小。对于类似动态调整大小的操作，务必说明创建一个更大的新数组并复制现有元素，因为伪代码数组无法原地调整大小。

10. Linking Arrays to Abstract Data Types (ADTs) | 数组与抽象数据类型（ADT）的联系

Stacks, queues, and circular queues are often implemented using arrays in the Edexcel specification. A stack may use an array and a top pointer; a linear queue uses an array along with front and rear pointers. The circular queue addresses the problem of unused space at the front of a linear queue.

Edexcel 考纲中，栈、队列和循环队列常通过数组实现。栈可使用数组和一个栈顶指针；线性队列使用数组以及队首和队尾指针。循环队列解决了线性队列前端空间浪费的问题。

When implementing these ADTs with arrays, you must handle the wrapping of indices in a circular queue using modular arithmetic: Rear ← (Rear + 1) MOD MaxSize. Knowing these implementation details is essential for Paper 1 ADT questions and Paper 2 programming scenarios.

用数组实现这些 ADT 时，必须通过模运算处理循环队列中的索引回绕：Rear ← (Rear + 1) MOD MaxSize。掌握这些实现细节对于 Paper 1 的 ADT 题目和 Paper 2 的编程场景至关重要。

11. Efficiency and Complexity Considerations | 效率与复杂度考量

Understanding time and space complexity with respect to arrays is directly examinable. Accessing an element by index is O(1); searching an unsorted array is O(n); sorting with bubble sort is O(n²). Inserting an element into a static array at an arbitrary position requires shifting elements and therefore costs O(n) on average.

与数组相关的时间和空间复杂度是可以直接考查的。通过索引访问元素为 O(1)；搜索未排序数组为 O(n)；冒泡排序为 O(n²)。在静态数组任意位置插入一个元素需要移动元素，因此平均代价为 O(n)。

Space complexity of an array is the product of element size and capacity. 2D arrays consume memory proportional to rows × columns. Be ready to discuss trade-offs, for instance why a static array might be chosen over a dynamic data structure when memory is constrained and the maximum size is known in advance.

数组的空间复杂度是元素大小与容量的乘积。二维数组消耗的内存与行×列成正比。请准备好讨论权衡，例如为什么在内存受限且已知最大规模时可能选择静态数组而不是动态数据结构。

12. Pseudocode Styles and Mark Scheme Expectations | 伪代码风格与评分标准预期

Edexcel accepts any consistent pseudocode style, but clarity in array declaration, indexing, and loop boundaries is crucial. You should use meaningful variable names, comment sparingly in the exam, and clearly define the size of arrays. When a question asks for an algorithm, the mark scheme rewards correctness of logic over syntactical perfection.

Edexcel 接受任何一致的伪代码风格，但数组声明、索引和循环边界的清晰性至关重要。你应该使用有意义的变量名、考试中简要注释，并明确定义数组大小。当题目要求算法时，评分标准更看重逻辑正确性而不是语法完美。

For full marks, ensure your solution handles all edge cases (empty array, full array, single-element array) where relevant. Practice writing code that initialises arrays, iterates with both FOR and WHILE loops, and uses Boolean flags and counters accurately.

要获得满分，请确保你的方案在相关情况下处理了所有边界情况（空数组、满数组、单元素数组）。请练习编写初始化数组、使用 FOR 和 WHILE 循环迭代，并准确使用布尔标志和计数器的代码。

Published by TutorHao | Computer Science Revision Series | aleveler.com

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

Arrays in A-Level Edexcel Computer Science: Key Exam Points | A-Level Edexcel 计算机：数组 考点精讲