Arrays vs Other Data Structures When to Choose Arrays in DSA C - 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 without checking others.

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

Dry Run Walkthrough

Input: array: [5, 8, 2, 9], access element at index 2

Goal: Show how arrays let us quickly find an item by its position

Step 1: Look at index 0 to check first item

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

Why: Start from the beginning to understand the layout

Step 2: Look at index 1 to check second item

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

Why: Move to next position to find the target index

Step 3: Look at index 2 and find the value 2

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

Why: We found the item at the desired position quickly

Result:

[0] -> 5 -> [1] -> 8 -> [2] -> 2 -> [3] -> 9 -> null
Accessed value: 2

Annotated Code

DSA C

#include <stdio.h>

// Function to access element at given index
int access_element(int arr[], int size, int index) {
    if (index < 0 || index >= size) {
        return -1; // index out of bounds
    }
    return arr[index]; // direct access by index
}

int main() {
    int arr[] = {5, 8, 2, 9};
    int size = sizeof(arr) / sizeof(arr[0]);
    int index = 2;
    int value = access_element(arr, size, index);
    if (value == -1) {
        printf("Index out of bounds\n");
    } else {
        printf("Array: [5, 8, 2, 9]\n");
        printf("Accessed value at index %d: %d\n", index, value);
    }
    return 0;
}

if (index < 0 || index >= size) {

check if index is valid to avoid errors

return arr[index];

directly access the element at given index for fast retrieval

Output

Array: [5, 8, 2, 9]

Accessed value at index 2: 2

Complexity Analysis

Time: O(1) because accessing any element by index in an array is immediate

Space: O(n) because the array stores n elements in contiguous memory

vs Alternative: Compared to linked lists, arrays allow faster access by index but resizing or inserting in middle is slower

Edge Cases

index is negative or greater than array size

function returns -1 and prints 'Index out of bounds'

DSA C

if (index < 0 || index >= size) {

array with one element

accessing index 0 returns the single element correctly

DSA C

return arr[index];

When to Use This Pattern

When you need fast access to elements by position and know the number of items in advance, arrays are the right choice.

Common Mistakes

Mistake: Trying to access an index outside the array bounds causing errors
Fix: Always check if index is within 0 and size-1 before accessing

Summary

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

Use arrays when you need fast access by index and the number of items is fixed or changes rarely.

The key insight is that arrays keep items side by side in memory, so you can jump directly to any position.

Practice

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

easy

A. When you need fast access to elements by index

B. When you want to easily insert or delete elements anywhere

C. When you need a flexible size that changes often

D. When you want to store key-value pairs

Solution

1. Step 1: Understand array access

   Arrays store elements in contiguous memory, so accessing by index is very fast (constant time).

2. Step 2: Compare with other structures

   Linked lists and trees have slower access by index because they require traversal. Arrays are best for fast index access.

3. Final Answer:

   When you need fast access to elements by index -> Option A

4. Quick Check:

   Fast index access = B [OK]

Hint: Arrays give fast index access, unlike linked lists [OK]

Common Mistakes:

• Thinking arrays are best for frequent insertions/deletions
• Confusing arrays with key-value stores
• Assuming arrays resize automatically

2. Which of the following is the correct way to declare an integer array of size 5 in C?

easy

A. int arr = new int[5];

B. int arr[5];

C. int arr();

D. array<int> arr(5);

Solution

1. Step 1: Recall C array syntax

   In C, arrays are declared with the type, name, and size in square brackets, like int arr[5];.

2. Step 2: Check other options

   int arr(); uses parentheses which is a function declaration. int arr = new int[5]; is C++ style with new. array<int> arr(5); is not valid C syntax.

3. Final Answer:

   int arr[5]; -> Option B

4. Quick Check:

   C arrays use square brackets for size = C [OK]

Hint: C arrays use square brackets for size declaration [OK]

Common Mistakes:

• Using parentheses instead of square brackets
• Using C++ style new keyword in C
• Confusing array declaration with function declaration

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

int arr[3] = {10, 20, 30};
printf("%d", arr[1]);

medium

A. 10

B. Compilation error

C. 20

D. 30

Solution

1. Step 1: Understand array initialization

   The array arr has elements 10 at index 0, 20 at index 1, and 30 at index 2.

2. Step 2: Identify printed element

   The code prints arr[1], which is the second element, value 20.

3. Final Answer:

   20 -> Option C

4. Quick Check:

   arr[1] = 20 [OK]

Hint: Array indexing starts at 0, so arr[1] is second element [OK]

Common Mistakes:

• Confusing index 1 with first element
• Expecting compilation error due to syntax
• Mixing up array initialization order

4. Identify the error in the following C code snippet that uses an array:

int arr[3];
arr[3] = 100;
printf("%d", arr[3]);

medium

A. Array index out of bounds error

B. Syntax error in array declaration

C. Missing semicolon after declaration

D. No error, code runs fine

Solution

1. Step 1: Check array size and indexing

   The array arr has size 3, so valid indices are 0, 1, and 2.

2. Step 2: Analyze the assignment and print

   The code assigns and prints arr[3], which is outside the valid range, causing out of bounds access.

3. Final Answer:

   Array index out of bounds error -> Option A

4. Quick Check:

   Index 3 invalid for size 3 array = A [OK]

Hint: Array indices go from 0 to size-1 only [OK]

Common Mistakes:

• Assuming index 3 is valid for size 3 array
• Thinking syntax error due to semicolon
• Believing code runs without error

5. You need to store a fixed number of sensor readings that will not change in size and require fast access by position. Which data structure is the best choice and why?

hard

A. Binary tree, because it keeps data sorted automatically

B. Linked list, because it allows easy insertion and deletion

C. Hash table, because it stores key-value pairs efficiently

D. Array, because it provides fast indexed access and fixed size

Solution

1. Step 1: Analyze requirements

   The sensor readings count is fixed and will not change, and fast access by position is needed.

2. Step 2: Match data structure features

   Arrays have fixed size and allow fast access by index. Linked lists are slower for access. Hash tables and trees serve different purposes.

3. Final Answer:

   Array, because it provides fast indexed access and fixed size -> Option D

4. Quick Check:

   Fixed size + fast access = Array = A [OK]

Hint: Fixed size and fast access? Choose array [OK]

Common Mistakes:

• Choosing linked list for fixed size data
• Confusing hash table use case
• Thinking binary tree is best for fixed size arrays