Arrays vs Other Data Structures When to Choose Arrays in DSA Rust - Trade-offs & Analysis

Mental Model

Arrays hold items in order, side by side, so you can find any item quickly by its position.

Analogy: Think of an egg carton where each egg has its own spot. You can grab the 3rd egg easily because you know exactly where it sits.

[0] -> 5 -> [1] -> 8 -> [2] -> 3 -> [3] -> 7 -> null

Dry Run Walkthrough

Input: array: [5, 8, 3, 7], want to find the 3rd item and add a new item 10 at the end

Goal: Show how arrays let us quickly get the 3rd item and add a new item by position

Step 1: Access the 3rd item by its index 2

[0] -> 5 -> [1] -> 8 -> [2↑] -> 3 -> [3] -> 7 -> null

Why: Arrays let us jump directly to any position without checking others

Step 2: Add new item 10 at the end (index 4)

[0] -> 5 -> [1] -> 8 -> [2] -> 3 -> [3] -> 7 -> [4↑] -> 10 -> null

Why: Arrays store items next to each other, so adding at the end is simple if space allows

Result:

[0] -> 5 -> [1] -> 8 -> [2] -> 3 -> [3] -> 7 -> [4] -> 10 -> null

Annotated Code

DSA Rust

fn main() {
    let mut arr = vec![5, 8, 3, 7];
    // Access the 3rd item (index 2)
    let third_item = arr[2];
    println!("Third item: {}", third_item);
    // Add new item 10 at the end
    arr.push(10);
    // Print all items
    for (i, val) in arr.iter().enumerate() {
        print!("[{}] -> {} -> ", i, val);
    }
    println!("null");
}

let third_item = arr[2];

directly access the item at index 2 for fast lookup

arr.push(10);

add new item at the end if space allows

for (i, val) in arr.iter().enumerate() { print!("[{}] -> {} -> ", i, val); }

iterate over array to show all items with their indices

Output

Third item: 3

[0] -> 5 -> [1] -> 8 -> [2] -> 3 -> [3] -> 7 -> [4] -> 10 -> null

Complexity Analysis

Time: O(1) for access because arrays let you jump directly to any index; O(1) amortized for adding at the end

Space: O(n) because arrays store all items in a continuous block of memory

vs Alternative: Compared to linked lists, arrays give faster access by index but slower insertions/deletions in the middle because items must shift

Edge Cases

empty array

accessing any index causes error; adding items works normally

DSA Rust

let third_item = arr.get(2);

array full with no extra space

push operation may trigger resizing internally to allow more items

DSA Rust

arr.push(10);

When to Use This Pattern

When you need fast access to items by position and know the number of items or can resize, choose arrays for their speed and simplicity.

Common Mistakes

Mistake: Trying to insert or remove items in the middle of an array without shifting elements
Fix: Remember arrays require shifting elements to keep order when inserting or deleting inside

Summary

Arrays store items in order and let you quickly find any item by its position.

Use arrays when you want fast access by index and mostly add or read items at the end.

The key insight is arrays keep items side by side, so you can jump straight to any spot.

Practice

1. Which of the following is the best reason to choose an array over other data structures like linked lists or hash maps?

easy

A. You want to store key-value pairs.

B. You need fast access to elements by index.

C. You need to frequently insert or delete elements in the middle.

D. You want to avoid fixed size limitations.

Solution

1. Step 1: Understand array access speed

   Arrays provide constant time access to elements by their index because elements are stored contiguously in memory.

2. Step 2: Compare with other data structures

   Linked lists and hash maps do not provide direct index access; linked lists require traversal, and hash maps use keys, not indexes.

3. Final Answer:

   You need fast access to elements by index. -> Option B

4. Quick Check:

   Fast index access = A [OK]

Hint: Arrays give quick element access by position [OK]

Common Mistakes:

• Confusing arrays with hash maps for key-value storage
• Thinking arrays are best for frequent insertions/deletions
• Ignoring fixed size limitation of arrays

2. Which of the following is the correct way to declare a fixed-size array of 5 integers in Rust?

easy

A. let arr: [i32; 5] = [0; 5];

B. let arr = [5; i32];

C. let arr = Vec<i32>::new(5);

D. let arr = array(5, 0);

Solution

1. Step 1: Recall Rust array syntax

   In Rust, fixed-size arrays are declared with type and size like [type; size].

2. Step 2: Check each option

   let arr: [i32; 5] = [0; 5]; correctly declares an array of 5 integers initialized to 0. let arr = [5; i32]; has wrong syntax, C creates a vector not an array, D is invalid Rust.

3. Final Answer:

   let arr: [i32; 5] = [0; 5]; -> Option A

4. Quick Check:

   Fixed-size array syntax = B [OK]

Hint: Use [type; size] syntax for fixed arrays in Rust [OK]

Common Mistakes:

• Using Vec instead of array for fixed size
• Wrong order of size and type in declaration
• Using non-Rust syntax for arrays

3. What will be the output of the following Rust code?

let arr = [10, 20, 30, 40, 50];
let slice = &arr[1..4];
println!("{:?}", slice);

medium

A. [20, 30, 40]

B. [30, 40, 50]

C. [20, 30, 40, 50]

D. [10, 20, 30]

Solution

1. Step 1: Understand Rust slice syntax

   The slice &arr[1..4] includes elements from index 1 up to but not including index 4.

2. Step 2: Identify elements in the slice

   Indexes 1, 2, 3 correspond to values 20, 30, and 40 respectively.

3. Final Answer:

   [20, 30, 40] -> Option A

4. Quick Check:

   Slice excludes end index = D [OK]

Hint: Slice includes start index, excludes end index [OK]

Common Mistakes:

• Including the end index element in the slice
• Confusing slice with full array
• Misreading index positions

4. Consider this Rust code snippet:

let mut arr = [1, 2, 3, 4, 5];
arr.push(6);

What is the error and how to fix it?

medium

A. The push method requires a reference; use &6.

B. The array is immutable; declare with let instead of let mut.

C. Arrays have no push method; use a Vec instead.

D. The array size is fixed; increase size to 6 in declaration.

Solution

1. Step 1: Identify array limitations in Rust

   Fixed-size arrays in Rust do not have a push method because their size cannot change.

2. Step 2: Suggest correct data structure

   Vectors (Vec) are growable arrays and support push.

3. Final Answer:

   Arrays have no push method; use a Vec instead. -> Option C

4. Quick Check:

   Fixed arrays no push = C [OK]

Hint: Use Vec for dynamic size, arrays are fixed [OK]

Common Mistakes:

• Trying to push on fixed-size arrays
• Confusing mutability with resizability
• Ignoring Rust's strict type and method rules

5. You need to store a large collection of numbers where you will frequently access elements by index and rarely add or remove elements. Which data structure should you choose in Rust and why?

hard

A. Use a hash map because it provides fast key-based access.

B. Use a Vec because it allows dynamic resizing and fast index access.

C. Use a linked list because it allows easy insertion and deletion anywhere.

D. Use a fixed-size array because it provides fast index access and fixed memory layout.

Solution

1. Step 1: Analyze access and modification needs

   Frequent index access requires fast, constant-time access. Rare modifications mean fixed size is acceptable.

2. Step 2: Compare arrays and vectors

   Fixed-size arrays have faster access and less overhead than vectors but cannot resize. Since additions/removals are rare, fixed size is fine.

3. Step 3: Exclude other structures

   Linked lists have slow index access; hash maps are for key-value, not index-based access.

4. Final Answer:

   Use a fixed-size array because it provides fast index access and fixed memory layout. -> Option D

5. Quick Check:

   Fast access + rare changes = fixed array [OK]

Hint: Fixed arrays excel with fast access and stable size [OK]

Common Mistakes:

• Choosing Vec when fixed size suffices
• Using linked list for index access
• Confusing hash map keys with indexes