Linked List vs Array When to Choose Which in DSA C - Why the Distinction Matters

The Big Idea

Discover why choosing the right list can save you from frustrating slowdowns and wasted effort!

The Scenario

Imagine you have a list of your favorite songs written on paper. You want to add new songs, remove some, or find a song quickly. If you write them all in a fixed order on a single sheet, adding or removing songs means rewriting the whole list or leaving empty spaces.

The Problem

Using a fixed sheet (like an array) means you must know the number of songs in advance. Adding or removing songs in the middle is slow because you have to move many songs around. Also, if you want to add more songs than the sheet size, you need a new bigger sheet and rewrite everything.

The Solution

A linked list is like a chain of small cards, each holding one song and a pointer to the next card. You can add or remove cards anywhere without moving others. This makes managing your list flexible and efficient when the size changes often.

Before vs After

✗ Before

int songs[6] = {1, 2, 3, 4, 5};
// To add a song in the middle, shift elements right
for (int i = 5; i > 2; i--) {
  songs[i] = songs[i-1];
}
songs[2] = 99;

✓ After

struct Node {
  int song;
  struct Node* next;
};
// To add a song, create a new node and adjust pointers
struct Node* new_node = malloc(sizeof(struct Node));
new_node->song = 99;
new_node->next = current->next;
current->next = new_node;

What It Enables

It enables easy and fast insertion or deletion of elements anywhere without shifting others, making dynamic data management smooth.

Real Life Example

Think of a playlist app where you often add or remove songs. Using a linked list helps the app quickly update your playlist without delays or wasted space.

Key Takeaways

Arrays are great for fixed-size, fast access by position.

Linked lists excel when you need frequent insertions and deletions.

Choosing the right structure depends on how you use your data.

Practice

1. Which data structure is better when you need fast random access to elements by index?

easy

A. Array

B. Linked List

C. Stack

D. Queue

Solution

1. Step 1: Understand random access in arrays

   Arrays store elements in contiguous memory, so accessing any element by index is fast and direct.

2. Step 2: Compare with linked list access

   Linked lists require traversal from the head to reach an element, making random access slower.

3. Final Answer:

   Array -> Option A

4. Quick Check:

   Random access = Array [OK]

Hint: For fast index access, choose arrays [OK]

Common Mistakes:

• Thinking linked lists provide fast random access
• Confusing stack or queue with random access
• Ignoring memory layout differences

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

easy

A. int arr{};

B. int arr();

C. int arr[5];

D. int arr = new int[5];

Solution

1. Step 1: Recall C array declaration syntax

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

2. Step 2: Check other options for errors

   int arr(); uses parentheses which is a function declaration, C uses braces which is invalid, D uses 'new' which is C++ syntax.

3. Final Answer:

   int arr[5]; -> Option C

4. Quick Check:

   C array declaration = int arr[5]; [OK]

Hint: Use square brackets for arrays in C [OK]

Common Mistakes:

• Using parentheses instead of brackets
• Using C++ 'new' keyword in C
• Using braces for array declaration

3. Consider the following C code snippet:

typedef struct Node {
  int data;
  struct Node* next;
} Node;

Node* head = NULL;

// Insert 3 nodes at the beginning
for (int i = 1; i <= 3; i++) {
  Node* newNode = (Node*)malloc(sizeof(Node));
  newNode->data = i;
  newNode->next = head;
  head = newNode;
}

// Print list
Node* temp = head;
while (temp != NULL) {
  printf("%d -> ", temp->data);
  temp = temp->next;
}
printf("NULL\n");

What is the printed output?

medium

A. 1 -> 2 -> 3 -> NULL

B. 3 -> 2 -> 1 -> NULL

C. NULL

D. 3 -> 1 -> 2 -> NULL

Solution

1. Step 1: Understand insertion at beginning in linked list

   Each new node is added at the head, so the last inserted node becomes the first in the list.

2. Step 2: Trace the loop values and list order

   Insert 1: list is 1 -> NULL Insert 2: list is 2 -> 1 -> NULL Insert 3: list is 3 -> 2 -> 1 -> NULL

3. Final Answer:

   3 -> 2 -> 1 -> NULL -> Option B

4. Quick Check:

   Insertion at head reverses order [OK]

Hint: Insertion at head reverses order [OK]

Common Mistakes:

• Assuming insertion appends at end
• Confusing order of nodes after insertion
• Ignoring pointer updates

4. The following code tries to insert a node at the end of a singly linked list but causes a runtime error. What is the error?

void insertEnd(Node** head, int val) {
  Node* newNode = (Node*)malloc(sizeof(Node));
  newNode->data = val;
  newNode->next = NULL;

  Node* temp = *head;
  while (temp->next != NULL) {
    temp = temp->next;
  }
  temp->next = newNode;
}

medium

A. Dereferencing NULL pointer when list is empty

B. Memory leak due to missing free()

C. Incorrect data assignment to newNode

D. Missing return statement in void function

Solution

1. Step 1: Analyze behavior when list is empty

   If *head is NULL, then temp = NULL. Accessing temp->next causes a runtime error (segmentation fault).

2. Step 2: Identify fix for empty list case

   Need to check if *head is NULL before loop and assign newNode as head if true.

3. Final Answer:

   Dereferencing NULL pointer when list is empty -> Option A

4. Quick Check:

   Empty list causes NULL pointer error [OK]

Hint: Check for empty list before traversal [OK]

Common Mistakes:

• Ignoring empty list case
• Confusing memory leak with pointer error
• Thinking missing return causes runtime error

5. You need to store a large number of elements where insertions and deletions happen frequently at random positions. Which data structure is more suitable and why? A) Array because it uses less memory B) Linked List because it allows efficient insertions and deletions C) Array because it provides faster random access D) Linked List because it uses contiguous memory

hard

A. Array because it uses less memory

B. Linked List because it uses contiguous memory

C. Array because it provides faster random access

D. Linked List because it allows efficient insertions and deletions

Solution

1. Step 1: Understand insertion and deletion costs

   Arrays require shifting elements for insertions/deletions at random positions, which is costly.

2. Step 2: Compare with linked list behavior

   Linked lists allow insertions and deletions by changing pointers without shifting elements, making them efficient for frequent changes.

3. Final Answer:

   Linked List because it allows efficient insertions and deletions -> Option D

4. Quick Check:

   Frequent insert/delete = Linked List [OK]

Hint: Frequent insert/delete? Choose linked list [OK]

Common Mistakes:

• Choosing array for frequent insertions
• Thinking linked list uses contiguous memory
• Ignoring cost of shifting in arrays