GCSE AQA Computer Science: Arrays Key Points | GCSE AQA 计算机：数组考点精讲

📚 GCSE AQA Computer Science: Arrays Key Points | GCSE AQA 计算机：数组考点精讲

Arrays are one of the foundational data structures in GCSE AQA Computer Science. Understanding how to declare, initialise, and manipulate arrays is essential for tackling programming questions, algorithm design, and data representation tasks. This revision guide covers every key topic listed in the specification, from basic one-dimensional arrays to two-dimensional structures, common algorithms, and exam-style problems.

数组是GCSE AQA计算机科学中最基础的数据结构之一。理解如何声明、初始化以及操作数组，对于解决编程题、设计算法和处理数据表示问题至关重要。这份复习指南涵盖了考纲中列出的所有关键主题，从基础的一维数组到二维结构、常见算法以及考试风格的题目。

1. What is an Array? | 什么是数组？

An array is a static data structure that stores a fixed number of elements, all of the same data type, in contiguous memory locations. Each element is accessed using an index, which typically starts at 0. Arrays can be one-dimensional (a list) or multi-dimensional (e.g., a table or grid). Unlike lists in Python, classic arrays have a predetermined size that cannot change during execution, which makes memory management predictable.

数组是一种静态数据结构，它在连续的内存位置中存储固定数量的元素，所有元素的数据类型都相同。每个元素都通过索引访问，索引通常从0开始。数组可以是一维（列表）或多维（例如表格或网格）。与Python中的列表不同，经典数组的大小在程序执行期间不能改变，这使得内存管理具有可预测性。

In AQA pseudocode, arrays are defined with a specified size, and the index range is provided. For example, array scores[5] creates an array of five index positions, typically 0 to 4. The benefit of arrays lies in their O(1) access time for any element when the index is known.

在AQA伪代码中，数组定义时会指定大小，并给出索引范围。例如，array scores[5] 创建了一个包含五个索引位置的数组，通常是0到4。数组的优势在于，当已知索引时，任何元素的访问时间复杂度都是 O(1)。

2. Declaring and Initialising Arrays | 声明和初始化数组

In pseudocode for the AQA exam, you declare an array by stating the data type, the array name, and the index range. For example: ARRAY scores[0:4] OF INTEGER declares an integer array called scores with indices 0 to 4. Initialisation can be done by assigning values to each element individually or by using a loop structure.

在AQA考试伪代码中，声明数组时需要给出数据类型、数组名称和索引范围。例如：ARRAY scores[0:4] OF INTEGER 声明了一个名为 scores 的整数数组，索引从0到4。初始化可以通过逐个赋值给每个元素，或者使用循环结构来完成。

In Python, which is often used for practical programming, arrays are simulated using lists: scores = [0] * 5 creates a list of five zeros. However, you must be able to translate pseudocode array operations into working Python code and vice versa. A common exam task is to complete an incomplete array initialisation given a set of requirements.

在Python中，通常用列表来模拟数组：scores = [0] * 5 创建一个包含五个零的列表。但是，你必须能够将伪代码数组操作转换为可运行的Python代码，反之亦然。常见的考试题型是根据一组要求完成不完整的数组初始化代码。

3. Indexing and Bounds | 索引与边界

Array indexing is the method of referring to individual elements. In most programming languages and the AQA pseudocode, the first element is at index 0, the second at index 1, and so on. The maximum index is one less than the size of the array. Attempting to access an index outside this range results in an ‘index out of bounds’ error, a common runtime error.

数组索引是引用单个元素的方法。在大多数编程语言和AQA伪代码中，第一个元素位于索引0，第二个位于索引1，依此类推。最大索引值为数组大小减一。试图访问超出此范围的索引会导致“索引越界”错误，这是一种常见的运行时错误。

For example, if an array names[0:4] is declared, valid indices are 0, 1, 2, 3, and 4 (five elements). Accessing names[5] would be invalid. Exam questions often test a candidate’s ability to identify logical errors such as off-by-one mistakes in FOR loop boundaries when iterating over an array.

例如，如果声明了数组 names[0:4]，有效索引为0、1、2、3和4（五个元素）。访问 names[5] 是无效的。考试题目通常会考察考生识别逻辑错误的能力，比如在遍历数组时FOR循环边界出现“差一错误”（off-by-one）。

Zero-based indexing: first element at 0 | 从零开始的索引：第一个元素位于0
One-based indexing: used in some pseudocode variants, always read question carefully | 从一开始的索引：某些伪代码变体中使用，务必仔细审题
Bounds checking: ensures index is within declared range | 边界检查：确保索引在声明的范围内

4. One-Dimensional Array Operations | 一维数组操作

Common operations on one-dimensional arrays include traversal, insertion (if dynamic), deletion, searching, and sorting. Although standard arrays in pseudocode are static, the exam may ask you to write algorithms that shift elements to simulate insertion or deletion within a fixed-size array. Loops are the primary mechanism for visiting each element in turn.

一维数组的常见操作包括遍历、插入（如果动态）、删除、搜索和排序。尽管伪代码中的标准数组是静态的，但考试可能会要求你编写算法，通过移动元素来模拟在固定大小数组内的插入或删除。循环是依次访问每个元素的主要手段。

A typical traversal uses a FOR loop: FOR i ← 0 TO 4 processes each element of a size-5 array. Outputting all elements, accumulating a sum, or finding the maximum/minimum value are standard exam scenarios. The key is to recognise the need for an index variable that is incremented each iteration.

典型的遍历使用FOR循环：FOR i ← 0 TO 4 处理一个大小为5的数组中的每个元素。输出所有元素、累加求和，或者寻找最大/最小值，都是标准的考试场景。关键在于要认识到需要一个在每次迭代中递增的索引变量。

5. Two-Dimensional Arrays | 二维数组

A two-dimensional (2D) array can be visualised as a table with rows and columns. It is declared with two index ranges, for example: ARRAY grid[0:2, 0:3] OF INTEGER creates a 3×4 integer grid. The first index often represents the row, and the second represents the column. 2D arrays are heavily examined in AQA GCSE, especially in the context of board games, pixel images, and data tables.

二维（2D）数组可以想象为一个有行和列的表格。它用两个索引范围来声明，例如：ARRAY grid[0:2, 0:3] OF INTEGER 创建一个3×4的整数网格。第一个索引通常表示行，第二个表示列。二维数组在AQA GCSE中考察频繁，特别是在棋盘游戏、像素图像和数据表格的场景中。

Nested loops are required to traverse all elements of a 2D array. An outer loop iterates over rows, and an inner loop iterates over columns. You may be asked to write code that sums all values, counts specific elements, or finds a value in a particular row or column.

遍历二维数组的所有元素需要使用嵌套循环。外层循环遍历行，内层循环遍历列。你可能会被要求编写代码来对所有值求和、统计特定元素，或者在特定行或列中查找某个值。

Declaration: ARRAY board[0:7, 0:7] OF CHAR for an 8×8 chessboard | 声明：ARRAY board[0:7, 0:7] OF CHAR 用于8×8棋盘
Assignment: grid[1, 2] ← 99 | 赋值：grid[1, 2] ← 99
Nested FOR: FOR row ← 0 TO 7, FOR col ← 0 TO 7 | 嵌套FOR：FOR row ← 0 TO 7, FOR col ← 0 TO 7

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

Two searching algorithms are explicitly on the AQA specification: linear search and binary search. Linear search checks each element sequentially until the target is found or the end is reached. It works on unsorted arrays and has a time complexity of O(n) in the worst case. Binary search repeatedly divides a sorted array in half, discarding the half that cannot contain the target, giving O(log n) performance.

AQA考纲明确要求两种搜索算法：线性搜索（线性查找）和二分查找（二分搜索）。线性搜索按顺序检查每个元素，直到找到目标或到达末尾为止。它适用于未排序的数组，最坏情况下的时间复杂度为O(n)。二分查找通过反复将有序数组减半，丢弃不可能包含目标的那一半，达到O(log n)的性能。

Key points for the exam: binary search requires the array to be sorted beforehand; if the array is not sorted, linear search must be used. You should be able to trace both algorithms step by step, showing the values of low, mid, and high pointers in binary search. AQA questions often provide a partially filled trace table that you must complete.

考试要点：二分查找要求数组预先排序；如果数组未排序，则必须使用线性搜索。你应该能够逐步追踪这两种算法，展示二分查找中low、mid和high指针的值。AQA的题目通常会提供一个部分填充的追踪表，要求你将其补全。

7. Sorting Algorithms on Arrays | 数组上的排序算法

The AQA GCSE specification requires knowledge of bubble sort and merge sort. Bubble sort repeatedly steps through the array, compares adjacent elements, and swaps them if they are in the wrong order. The pass through the array is repeated until no swaps are needed. It is a simple but inefficient O(n²) algorithm suitable mainly for small datasets.

AQA GCSE考纲要求掌握冒泡排序和归并排序。冒泡排序重复遍历数组，比较相邻的元素，如果顺序错误就交换它们。不断重复遍历，直到不需要交换为止。这是一种简单但效率较低的O(n²)算法，主要适用于小型数据集。

Merge sort is a divide-and-conquer algorithm that splits the array into halves until sub-arrays contain a single element, then merges them back together in sorted order. It has a time complexity of O(n log n) and is more efficient for large arrays. The exam may ask for a comparison of the two algorithms or require you to describe the merge process step by step.

归并排序是一种分治算法，它将数组分成两半，直到子数组只包含一个元素，然后按照排序顺序将它们合并回去。它的时间复杂度为O(n log n)，对于大型数组更高效。考试可能要求比较这两种算法，或者要求你逐步描述合并过程。

Bubble sort: stable, in-place, O(n²) | 冒泡排序：稳定，原地排序，O(n²)
Merge sort: stable, not in-place (requires extra memory), O(n log n) | 归并排序：稳定，非原地排序（需要额外内存），O(n log n)

8. Using Arrays with Files and Records | 数组与文件和记录的结合使用

Arrays are frequently used to store data read from files. In AQA pseudocode, a common pattern is to read lines from a text file and store each item in an array element. Since the array size is static, you need to know the number of records in advance or use a sentinel value to stop reading. Records (structured data) can also be stored in arrays of records, where each element is a record variable.

数组经常用于存储从文件中读取的数据。在AQA伪代码中，一个常见的模式是从文本文件中逐行读取，并将每个条目存储在数组元素中。由于数组大小是静态的，你需要事先知道记录的数量，或者使用一个标记值来停止读取。记录（结构化数据）也可以存储在记录数组（array of records）中，即每个元素是一个记录变量。

Example: an array of student records, where each record contains a name, a score, and a grade. You might be asked to write code that searches for a specific student or calculates an average score from this array.

例如：一个学生记录数组，每个记录包含姓名、分数和等级。你可能需要编写代码来搜索特定学生，或者根据该数组计算平均分数。

9. Common Pitfalls and Exam Tips | 常见错误与考试技巧

Students often confuse index values with the number of elements. Remember that an array declared as [0:4] has five elements, not four. Another common mistake is using array length incorrectly in loop conditions, which leads to off-by-one errors. Always double-check that your loop counter starts at the first index and stops at the last.

学生经常混淆索引值和元素数量。请记住，声明为[0:4]的数组有五个元素，而不是四个。另一个常见错误是在循环条件中错误地使用数组长度，导致差一错误。务必反复检查循环计数器从第一个索引开始，到最后一个索引结束。

When writing pseudocode, stick to the AQA style: use ← for assignment, == or = for comparison as per question instructions, and clearly indicate array indices with square brackets. In trace tables, the values you fill in must match exactly the logic of the algorithm, even if the algorithm has a bug – you are tracing what the code does, not what it should do.

编写伪代码时，请坚持AQA风格：使用←进行赋值，根据题目指示使用==或=进行比较，并用方括号清楚地标明数组索引。在追踪表中，你填写的值必须完全匹配算法的逻辑，即使算法存在错误——你需要追踪代码实际做了什么，而不是它应该做什么。

10. Sample Exam-Style Question Walkthrough | 真题风格样题解析

Question: “A program stores the weekly temperatures (in °C) for 7 days in a 1D array temps[0:6]. Write a pseudocode algorithm to find the highest temperature and the day it occurred.”

题目：“一个程序将一周7天的温度（单位：°C）存储在一维数组temps[0:6]中。编写一个伪代码算法，找出最高温度及其出现的日期。”

Solution approach: Initialise a variable max_temp to the first element, and max_day to 0. Use a FOR loop from index 1 to 6. If the current element is greater than max_temp, update both variables. Output the results after the loop.

解题思路：将变量max_temp初始化为第一个元素，max_day初始化为0。使用FOR循环从索引1遍历到6。如果当前元素大于max_temp，则更新两个变量。循环结束后输出结果。

max_temp ← temps[0]
max_day ← 0
FOR i ← 1 TO 6
IF temps[i] > max_temp THEN
max_temp ← temps[i]
max_day ← i
ENDIF
ENDFOR
OUTPUT max_temp, max_day

This algorithm correctly handles ties by keeping the first occurrence of the maximum, which is usually acceptable unless specified otherwise. Always read the question to see if all occurrences should be recorded.

此算法通过保留最大值首次出现来处理并列情况，除非题目另有规定，否则通常是可以接受的。务必阅读题目，看是否需要记录所有出现的位置。

11. Summary of Key Array Concepts | 数组核心概念总结

Arrays provide a straightforward way to organise multiple data items under a single name. Their static nature means bounds must be respected; dynamic expansion is not part of the GCSE standard array model. Mastery of array indexing, traversal with FOR loops, and basic algorithms such as search and sort is directly assessed in both Paper 1 and the programming component of Paper 2.

数组提供了一种直接的方式来将多个数据项组织在一个名称下。其静态特性意味着必须遵守边界限制；动态扩展不在GCSE标准数组模型的范围内。掌握数组索引、使用FOR循环遍历以及搜索和排序等基本算法，将直接在两份试卷（Paper 1和Paper 2的编程部分）中受到考察。

Ensure you can confidently translate between AQA pseudocode and your chosen programming language (typically Python). Practice writing trace tables for bubble sort, merge sort, linear search, and binary search on arrays of varying sizes to build speed and accuracy for the exam.

确保你能够自信地在AQA伪代码和你选择的编程语言（通常是Python）之间进行相互转换。练习为不同大小的数组编写冒泡排序、归并排序、线性搜索和二分查找的追踪表，以提高考试时的速度和准确性。

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

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

GCSE AQA Computer Science: Arrays Key Points | GCSE AQA 计算机：数组 考点精讲