Arrays

Why arrays matter so much in algorithms

An array is one of the simplest data structures, but it is also one of the best places to learn algorithmic thinking. Elements are arranged by index, any element can be accessed directly, and the order of the data is easy to use for searching, counting, and transformations.

In algorithmic problems, an array often becomes more than just a container: it becomes the space through which an algorithm moves. One index travels from left to right, two pointers move toward each other, a window covers the current range, and prefix sums let us answer range queries quickly.

What this section covers

• Array Basics. We will revisit the array properties that matter most for algorithms: indexes, fixed length, fast element access, and the cost of common operations.
• Array Traversal. You will learn to choose a traversal direction, work with indexes, and handle boundaries carefully.
• Two Pointers. We will examine an approach where two indexes jointly narrow the search area or maintain the required state without unnecessary nested loops.
• Sliding Window. We will see how to work efficiently with consecutive subarrays by updating the current window instead of recalculating every range from scratch.
• Prefix Sums. We will prepare accumulated values once so that sums over arbitrary ranges can later be obtained quickly.
• In-place Operations. You will learn to modify an array directly and understand when this avoids the need for an additional data structure.
• Matrices. We will transfer familiar ideas to two-dimensional data: rows, columns, neighboring cells, and table boundaries.

One array, many ways to think

int[] numbers = {4, 1, 7, 3};

for (int value : numbers) {
    System.out.println(value);
}

This code simply traverses the elements. Later, the same array can be processed from both ends, examined in ranges, preprocessed, or modified without creating a copy. The main goal of this section is to learn to see indexes as a tool for building an algorithm.