Arrays and ArrayLists - Computer Science A AP Study Notes

Arrays are fixed-size, homogeneous data structures that store elements of the same data type in contiguous memory locations, accessed via zero-based indexing. In Java, arrays are objects with a fixed length determined at creation: int[] numbers = new int[5]; creates an integer array of size 5.

ArrayLists are dynamic, resizable collections from the Java Collections Framework (java.util.ArrayList) that automatically grow or shrink as elements are added or removed. They use generic types for type safety: ArrayList<String> names = new ArrayList<>();

Key Differences:

• Size flexibility: Arrays have fixed length; ArrayLists resize automatically
• Type storage: Arrays hold primitives (int, double) or objects; ArrayLists only hold objects (using wrapper classes like Integer, Double)
• Performance: Arrays offer faster access (O(1)) with lower memory overhead; ArrayLists have slight overhead due to dynamic resizing
• Syntax: Arrays use array[index]; ArrayLists use methods like .get(index) and .set(index, value)

Essential ArrayList Methods:

• add(element) – appends to end (O(1) average)
• add(index, element) – inserts at position (O(n))
• get(index) – retrieves element (O(1))
• set(index, element) – replaces element (O(1))
• remove(index) – deletes element (O(n))
• size() – returns number of elements

Memory Visualization: Think of an array as a row of numbered boxes (0 to n-1), permanently fixed in place. An ArrayList is like an expandable accordion folder that can add new compartments when needed.

Cambridge Syllabus Note: Understanding when to use arrays versus ArrayLists demonstrates computational thinking and appropriate data structure selection—a key assessment objective.

Real-World Analogy: Arrays are like airport parking spaces—numbered consecutively (0, 1, 2...), each holding exactly one vehicle type, with a fixed total capacity that cannot change. ArrayLists are like Netflix queues—you can add unlimited shows, remove watched ones, and the list reorganizes automatically.

Practical Applications:

Arrays in Action:

• Monthly sales data: double[] monthlySales = new double[12]; stores exactly 12 months of revenue—the number of months won't change
• RGB color values: int[] pixelColor = {255, 128, 0}; represents fixed red-green-blue components
• Exam scores: When you know exactly 30 students took a test: int[] scores = new int[30];

ArrayLists in Practice:

• Social media followers: ArrayList<String> followers = new ArrayList<>(); grows as users follow you
• Shopping cart: Items added/removed dynamically—cart.add("Laptop"); cart.remove(0);
• Game inventory: Players collect items of unknown quantity: ArrayList<Item> inventory = new ArrayList<>();

Why the Distinction Matters: Consider a chess board (8×8 grid)—an array is perfect because the board never changes size. But a to-do list app needs an ArrayList because tasks are constantly added, completed, and removed. Using an array for a to-do list would require predicting maximum tasks and waste memory; using an ArrayList for a chess board adds unnecessary complexity.

Performance Trade-off: Arrays are like direct dial phones (instant access to any position), while ArrayLists are like smartphone contact lists (slightly slower due to method calls, but far more flexible). The Cambridge syllabus expects you to justify your choice based on problem requirements.