📚 Arrays in IB and WJEC Computer Science: Key Exam Points | IB WJEC 计算机：数组 考点精讲
Arrays are one of the most fundamental data structures in computer science, appearing in almost every programming language and forming the backbone of many algorithms. For students preparing for the IB Computer Science and WJEC A Level Computer Science exams, a deep understanding of arrays – from declaration and traversal to algorithmic application and common pitfalls – is essential. This guide unpacks the key concepts, demonstrates typical exam-style operations, and bridges theory with practical coding scenarios to ensure you can answer any array-related question with confidence.
数组是计算机科学中最基础的数据结构之一，几乎出现在每一种编程语言中，并构成众多算法的骨架。对于备考 IB 计算机科学和 WJEC A Level 计算机科学的学生而言，透彻理解数组——从声明、遍历到算法应用和常见陷阱——至关重要。本指南将逐一剖析核心概念，演示典型考试操作，并在理论与实践之间架起桥梁，确保你能够自信地回答任何与数组相关的问题。
1. What is an Array? Definition and Characteristics | 什么是数组？定义与特点
An array is a homogeneous, contiguous data structure that stores a fixed-size sequential collection of elements of the same data type. In memory, all elements are placed one after another, which allows direct access to any element using an index. This property is often described as random access: you can retrieve the i-th element in constant time, no matter how large the array is.
数组是一种同质、连续的数据结构，它存储固定大小的、同类型的元素序列。在内存中，所有元素依次排列，从而可以通过索引直接访问任意元素。这一特性常被称为随机访问：无论数组有多大，你都能在常数时间内获取第 i 个元素。
The key characteristics of arrays that examiners expect you to remember are: a fixed number of elements (static length), elements can be accessed in O(1) time, memory is allocated contiguously, and the entire structure can be passed to functions by reference, meaning modifications inside a function affect the original array.
考官期望你记住的数组关键特征包括：元素数量固定（静态长度），访问元素的时间复杂度为 O(1)，内存连续分配，以及整个结构可以按引用传递给函数，意味着函数内部对数组的修改会影响原始数组。
It is important to note that while many high-level languages offer dynamic array-like structures (e.g., Python’s list, Java’s ArrayList), the classic array is static and its size must be defined at compile time or at the time of creation. In IB and WJEC pseudocode, this distinction is often highlighted, and you may be asked to perform operations on a statically sized array.
需要注意，尽管许多高级语言提供了类似动态数组的结构（如 Python 的列表、Java 的 ArrayList），但经典数组是静态的，其大小必须在编译时或创建时确定。在 IB 和 WJEC 伪代码中，这一区别经常被强调，你可能会被要求对静态大小的数组执行操作。
2. Array Declaration and Initialisation | 数组的声明与初始化
Declaring an array requires specifying the data type, the array name, and the maximum number of elements it can hold. In pseudocode commonly used in both IB and WJEC papers, this may look like: ARRAY myArray[0:9] OF INTEGER – this creates an array with indices from 0 to 9, holding 10 integers. Providing initial values can be done using curly braces or via a loop.
声明数组需要指定数据类型、数组名称以及它能容纳的最大元素数量。在 IB 和 WJEC 试卷常用的伪代码中，声明可能类似于：ARRAY myArray[0:9] OF INTEGER——这创建了一个索引从 0 到 9、可容纳 10 个整数的数组。赋初值可以通过花括号或用循环完成。
In many programming languages, array indices default to starting at 0, and the valid range is 0 to (size – 1). However, some pseudocode notations allow you to define a custom index range, such as ARRAY scores[1:100] OF REAL. You must pay close attention to whether the exam question expects zero-based or one-based indexing, because correct index calculation is a common marking point.
在许多编程语言中，数组索引默认为从 0 开始，有效范围是 0 到（长度 – 1）。然而，某些伪代码标记允许你定义自定义索引范围，例如 ARRAY scores[1:100] OF REAL。你必须密切注意考题要求的是基于 0 还是基于 1 的索引，因为正确的索引计算是常见的得分点。
Initialisation can also be partial; unused elements often hold default values like 0 or null. In an exam context, when tracing an algorithm, you must know the initial state of every cell before any assignment takes place.
初始化也可以是部分的；未使用的元素通常持有默认值，如 0 或 null。在考试中，追踪算法时，你必须在任何赋值发生前清楚每个存储单元的初始状态。
3. Indexing and Accessing Elements | 索引与元素访问
Accessing an array element is achieved using its index enclosed in square brackets: value ← arr[4]. This operation takes constant time because the computer calculates the memory address of the element by adding the offset (index × element size) to the base address of the array. This is a core concept in computer architecture and appears in WJEC unit 1 questions on addressing.
访问数组元素通过将其索引放在方括号内实现：value ← arr[4]。此操作用时常数时间，因为计算机通过将偏移量（索引 × 元素大小）加到数组基地址上来计算该元素的内存地址。这是计算机体系结构中的核心概念，出现在 WJEC 单元 1 有关寻址的考题中。
When using loops to iterate over an array, the index variable must never fall below the lower bound or exceed the upper bound. A typical mistake is using i <= n when the array was declared with indices 0 to n-1. This leads to an ‘out-of-bounds’ error, which can cause a program to crash or produce undefined results – and in exams, you will lose marks for incorrect bounds.
当使用循环遍历数组时，索引变量绝不能低于下界或超出上界。一个典型的错误是，当数组以索引 0 到 n-1 声明时，却使用了 i <= n。这将导致“越界”错误，可能使程序崩溃或产生未定义结果——在考试中，你会因边界错误而失分。
Examiners also test your ability to access elements relative to a given pointer. For example, in a queue implemented using an array, you may need to access queue[head] and increment head modulo size. Understanding how indices wrap around is vital.
考官还会考查你相对于给定指针访问元素的能力。例如，在使用数组实现的队列中，你可能需要访问 queue[head] 并令 head 按数组大小取模递增。理解索引如何绕回至关重要。
4. Traversing Arrays | 数组的遍历
Traversal means visiting each element of an array exactly once, typically using a loop. The most common structure is a FOR loop: FOR i ← 0 TO 9 to process an array of size 10. You can also use a WHILE loop with a condition that checks the index, which is particularly useful when you might stop early upon finding a specific value.
遍历意味着恰好访问数组的每个元素一次，通常使用循环完成。最常见的结构是 FOR 循环：FOR i ← 0 TO 9 来处理大小为 10 的数组。你也可以使用带索引检查条件的 WHILE 循环，这在找到特定值后可能提前停止时特别有用。
In IB and WJEC pseudocode, it is acceptable to use FOR EACH element IN array when you do not need the index. However, you must be aware that in some lower-level pseudocode, such a construct might not be available, and you will be expected to write explicit index updates.
在 IB 和 WJEC 伪代码中，当你不需要索引时，可以使用 FOR EACH element IN array。但你必须知道，在某些底层伪代码中，可能没有这种结构，届时你应当写出明确的索引更新。
When traversing a two-dimensional array, a nested loop is required. The outer loop typically iterates over rows and the inner loop over columns, or vice versa depending on whether you are performing row-major or column-major traversal. Questions often ask you to output the elements in a specific order or to sum all elements in each row.
遍历二维数组时，需要使用嵌套循环。外层循环通常按行迭代，内层循环按列迭代，或者反过来，这取决于你是按行优先还是列优先遍历。考题经常要求你按特定顺序输出元素，或求每一行所有元素之和。
5. Common Operations: Insertion, Deletion, and Searching | 常见操作：插入、删除与查找
Inserting an element into a static array is not straightforward because the array size is fixed. If there is empty space, insertion may require shifting all subsequent elements one position to the right, which takes O(n) time. In exam tasks, you might be given a partially filled array and asked to write pseudocode to insert a value at a given index while preserving order.
向静态数组插入一个元素并不简单，因为数组大小是固定的。如果有空位，插入可能需要将所有后续元素向右移动一位，这需要 O(n) 时间。在考试任务中，你可能会得到一个部分填充的数组，并要求你编写伪代码，在保持顺序的同时在给定索引处插入一个值。
Deletion is similar: you must shift elements to the left to fill the gap. The time complexity is also O(n). You must be careful to overwrite the element and properly reduce the count of ‘used’ cells. In WJEC papers, such operations are often embedded in algorithms for stacks or queues implemented with arrays.
删除操作与之类似：你必须将元素向左移动以填补空隙。时间复杂度也是 O(n)。你必须小心地覆盖该元素，并适当减少“已用”单元格的计数。在 WJEC 试卷中，这类操作经常嵌入在使用数组实现的栈或队列算法中。
Searching is one of the most heavily examined topics. A linear search inspects each element sequentially, with O(n) complexity. If the array is sorted, binary search can be used, which repeatedly divides the search interval in half, achieving O(log n) time. In IB exams, you may need to trace a binary search or explain its preconditions. WJEC frequently asks for pseudocode of both searches and analysis of their efficiency.
查找是考查最频繁的主题之一。线性查找按顺序检查每个元素，复杂度为 O(n)。如果数组有序，则可以使用二分查找，它反复将搜索区间一分为二，实现 O(log n) 时间。在 IB 考试中，你可能需要追踪二分查找或解释其前提条件。WJEC 经常要求写出两种查找的伪代码并分析其效率。
6. Multidimensional Arrays | 多维数组
A two-dimensional (2D) array can be visualised as a table with rows and columns, declared as ARRAY matrix[0:4, 0:4] OF INTEGER. Each dimension has its own index range. Memory allocation for a 2D array is still contiguous, either in row-major order (elements of a row are stored together) or column-major order, though at the exam level you rarely need to concern yourself with the physical layout unless asked explicitly.
二维数组可以可视化为带有行和列的表格，声明为 ARRAY matrix[0:4, 0:4] OF INTEGER。每个维度有自己的索引范围。二维数组的内存分配仍然是连续的，要么按行优先顺序（一行的元素存储在一起）要么按列优先顺序，不过在考试层级你很少需要关心物理布局，除非题目明确提问。
Accessing a 2D array element requires two indices: matrix[row, column]. Nested loops are essential for operations like matrix addition, transpose, or printing in a tabular format. In IB, questions often involve image representation – for example, a 10×10 array of integers representing pixel brightness values, where you must write code to detect edges or apply a filter.
访问二维数组元素需要两个索引：matrix[row, column]。嵌套循环对于矩阵加法、转置或以表格形式打印等操作必不可少。在 IB 中，问题经常涉及图像表示——例如，一个 10×10 的整数数组代表像素亮度值，你需要编写代码检测边缘或应用滤波器。
Higher-dimensional arrays (3D and above) follow the same pattern. While uncommon in pseudocode questions, they may appear in data structure descriptions, such as a 3D array holding colour channels of a video frame. The underlying principle of index calculation – multiplying the index of each dimension by the cumulative product of subsequent dimensions – underlies both exam theory and compiler design.
更高维数组（三维及以上）遵循相同模式。虽然伪代码题中不常见，但它们可能出现在数据结构描述中，例如一个保存视频帧颜色通道的三维数组。其底层的索引计算原理——将每一维的索引乘以后续维度的累积乘积——是考试理论和编译器设计的基础。
7. Arrays in Sorting and Searching Algorithms | 数组在排序与搜索算法中的应用
Arrays are the natural home for sorting algorithms. Bubble sort, selection sort, and insertion sort all operate directly on arrays by swapping or shifting elements. You must be able to write, trace, and compare their time complexities. For IB, emphasis is on understanding the number of comparisons and swaps; WJEC often expects you to implement a sort given a partially coded solution.
数组是排序算法的天然载体。冒泡排序、选择排序和插入排序都通过交换或移动元素直接在数组上操作。你必须能够写出、追踪并比较它们的时间复杂度。对于 IB，重点在于理解比较和交换的次数；WJEC 经常期望你根据部分已编写的代码实现一种排序。
When performing a binary search, the array must already be sorted. This illustrates a key design choice: preprocessing data (sorting) can drastically accelerate subsequent queries. In an exam, you might be asked: “A program needs to search a large database 106 times. Explain why sorting the database first reduces overall runtime.” The answer pivots on O(n) vs O(log n) per search.
执行二分查找时，数组必须已排序。这阐明了一个关键的设计选择：预处理数据（排序）可以极大地加速后续查询。在考试中，你可能会被问到：“一个程序需要搜索一个大型数据库 106 次。解释为什么先排序数据库会减少总体运行时间。”答案关键在于每次搜索是 O(n) 对比 O(log n)。
Efficiency analysis is often tested with Big O notation. For an array of size n: getting an element by index is O(1); searching in an unsorted array is O(n); binary search is O(log n); average case for simple sorts is O(n²). Being able to justify these and identify them in given code fragments is a core skill.
效率分析常以 Big O 记号考查。对于大小为 n 的数组：按索引获取元素是 O(1)；无序数组查找是 O(n)；二分查找是 O(log n)；简单排序的平均情况是 O(n²)。能够论证这些复杂度并在给定代码片段中识别它们是核心技能。
8. Dynamic Arrays and Memory Considerations | 动态数组与内存考量
Strictly speaking, the term ‘dynamic array’ refers to a data structure that can resize itself, such as the list in Python or ArrayList in Java. While these are not part of the classic static array definition, both IB and WJEC syllabi touch on the concept of dynamic data structures and memory management. Knowing how a dynamic array grows – typically by allocating a larger block, copying elements, and releasing the old block – is valuable for higher-grade answers.
严格来说，“动态数组”这个术语指的是可以自行调整大小的数据结构，例如 Python 中的 list 或 Java 中的 ArrayList。虽然它们不属于经典的静态数组定义，但 IB 和 WJEC 教学大纲都涉及动态数据结构与内存管理的概念。了解动态数组如何增长——通常是通过分配更大的内存块、复制元素并释放旧块——对于获得高分的答案很有价值。
In WJEC unit 4 or IB option topics, you may encounter questions on how dynamic arrays amortise the cost of insertion. For example, when a dynamic array is full and a new element is added, copying all n elements to a new location takes O(n) time, but this happens rarely. This leads to an amortised complexity of O(1) per insertion.
在 WJEC 单元 4 或 IB 选修主题中，你可能会遇到关于动态数组如何摊还插入代价的问题。例如，当动态数组已满并添加新元素时，将所有 n 个元素复制到新位置需要 O(n) 时间，但这种情况很少发生。这导致每次插入的摊还复杂度为 O(1)。
Memory wastage and fragmentation are also discussed. A static array may reserve more slots than needed, wasting memory, while a dynamic structure can grow on demand but carries the overhead of occasional copying. Examiners like to ask students to compare arrays and linked lists in this context, so be ready to contrast contiguous allocation with non-contiguous, pointer-based structures.
内存浪费与碎片化也会被讨论。静态数组可能预留了超过所需的槽位而浪费内存，而动态结构可以按需增长但伴随着偶尔复制的开销。考官喜欢让学生在这种背景下比较数组和链表，因此准备好将连续分配与基于指针的非连续结构进行对比。
9. Bounds Checking and Common Pitfalls | 边界检查与常见陷阱
One of the most frequent causes of error in array-based programs – and a regular source of exam marks – is failing to validate indices. Accessing arr[-1] or arr[arraySize] leads to undefined behaviour or runtime exceptions. In IB, pseudocode assumes that indices are always valid unless otherwise stated, but WJEC often expects you to add explicit checks like IF index >= 0 AND index < len THEN.
基于数组的程序中最常见的错误原因之一——也是考试的常见失分点——是未能验证索引。访问 arr[-1] 或 arr[arraySize] 会导致未定义行为或运行时异常。在 IB 中，伪代码假定索引总是有效的，除非另有说明，但 WJEC 经常期望你添加显式检查，如 IF index >= 0 AND index < len THEN。
Off-by-one errors are another classic trap. When processing an array of size n, a loop that runs from 0 to n (inclusive) iterates n+1 times, typically overflowing the array. Similarly, confusing the length n with the maximum index n-1 can lead to incomplete traversals or incorrect output. Dry running code with low values of n is the best way to catch these mistakes.
“差一错误”是另一个经典陷阱。处理大小为 n 的数组时，从 0 到 n（含）运行的循环会迭代 n+1 次，通常导致数组溢出。同样，混淆长度 n 与最大索引 n-1 可能导致遍历不完整或输出错误。在 n 值较小时用纸笔运行代码是捕捉这些错误的最佳方式。
Another subtle pitfall involves aliasing. When two array variables reference the same array, modifications through one affect the other. In exam trace questions, assume that an assignment like arr2 ← arr1 copies the reference, not the content, unless the question specifies deep copying. Not realising this can lead to entirely wrong state tables.
另一个隐蔽的陷阱涉及别名。当两个数组变量引用同一数组时，通过一个变量进行的修改会影响另一个。在考试追踪题中，假定像 arr2 ← arr1 这样的赋值复制的是引用而非内容，除非题目明确指定深拷贝。意识不到这一点可能导致状态表完全错误。
10. Exam-Style Questions and Strategies | 考试题型与答题策略
Typical IB exam questions on arrays may ask you to: (1) write pseudocode to find the maximum value in an array; (2) output the elements in reverse order without using a second array; (3) explain why an array is suitable for implementing a stack; or (4) trace a fragment of code and complete a table showing variable values and output. Mastering these patterns requires practising with past papers.
典型的 IB 数组考试问题可能要求你：(1) 编写伪代码找出数组中的最大值；(2) 不使用第二个数组将元素逆序输出；(3) 解释为什么数组适合实现栈；或 (4) 追踪一段代码并完成一个显示变量值和输出的表格。掌握这些模式需要练习历年真题。
WJEC exam questions often include a partially completed program with blanks to fill, or ask you to describe what a given algorithm does when applied to an array. They also like to combine arrays with file handling – for instance, reading 100 integers from a file into an array and then performing statistical calculations. Ensure you are comfortable with both console I/O and array processing.
WJEC 考试题经常包含一个需填空的、部分完成的程序，或要求你描述给定算法应用于数组时的作用。他们也喜欢将数组与文件处理结合起来——例如，从文件中读取 100 个整数放进数组，然后进行统计计算。确保你既熟悉控制台输入输出，也熟悉数组处理。
General strategies for tackling array questions: first, clearly identify the size and index range. Then, dry run any operation with a small dataset to visualise the changes. When writing code, always initialise variables and handle boundary conditions. For trace tables, keep a neat grid of index, array content, and any accumulator variables. Time management is vital; if a question asks for a 3-mark explanation, don’t write a full page – be precise and reference the key concepts from this guide.
应对数组题目的通用策略：首先，明确数组的大小和索引范围。然后，用一个小的数据集手动模拟任何操作，以可视化变化。编写代码时，始终初始化变量并处理边界条件。对于追踪表格，保持一个清晰的网格，列出索引、数组内容和任何累加器变量。时间管理至关重要；如果一道题要求一个 3 分的解释，不要写满一页，要精确并引用本指南中的关键概念。
Published by TutorHao | Computer Science Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导