Linked list vs array comparison in Data Structures Theory - Performance Comparison

Time Complexity: Linked list vs array comparison

O(1) for array access, O(n) for linked list access

Understanding Time Complexity

When comparing linked lists and arrays, it is important to understand how their operations take time as the data grows.

We want to know how fast or slow common actions like accessing, inserting, or deleting elements become as the list or array gets bigger.

Scenario Under Consideration

Analyze the time complexity of accessing and inserting elements in arrays and linked lists.

// Array access
value = array[index]

// Linked list access
node = head
for i in range(index):
    node = node.next
value = node.value

// Array insertion at end
array.append(new_value)

// Linked list insertion at head
new_node.next = head
head = new_node

This code shows how to access elements by index and insert elements in arrays and linked lists.

Identify Repeating Operations

Look at the loops and steps repeated for each operation.

• Primary operation: Accessing an element by index in a linked list requires walking through nodes one by one.
• How many times: Up to n times for linked list access, but only once for array access.
• Insertion at the end of an array is usually one step, but insertion at the head of a linked list is also one step.

How Execution Grows With Input

As the number of elements grows, the time to access an element changes differently for arrays and linked lists.

Input Size (n)	Array Access Steps	Linked List Access Steps
10	1	Up to 10
100	1	Up to 100
1000	1	Up to 1000

Pattern observation: Array access time stays the same no matter how big it gets, but linked list access time grows linearly with size.

Final Time Complexity

Time Complexity: O(1) for array access, O(n) for linked list access

This means accessing any element in an array is fast and constant time, while in a linked list it takes longer as the list grows.

Common Mistake

[X] Wrong: "Accessing elements in a linked list is as fast as in an array because both store data in order."

[OK] Correct: Linked lists store elements in separate nodes linked by pointers, so you must follow each link one by one, making access slower as the list grows.

Interview Connect

Understanding these differences helps you explain why you might choose one data structure over another depending on the task, showing clear thinking about efficiency.

Self-Check

"What if we used a doubly linked list instead of a singly linked list? How would the time complexity for accessing elements change?"

Practice

1. Which data structure stores elements in continuous memory locations?

easy

A. Linked list

B. Graph

C. Tree

D. Array

Solution

1. Step 1: Understand array memory layout

   Arrays store elements in continuous memory blocks, allowing direct access by index.

2. Step 2: Compare with linked list memory layout

   Linked lists store elements in nodes scattered in memory, connected by pointers.

3. Final Answer:

   Array -> Option D

4. Quick Check:

   Continuous memory = Array [OK]

Hint: Continuous memory means array, not linked list [OK]

Common Mistakes:

• Confusing linked list nodes as continuous
• Thinking trees or graphs store data continuously
• Assuming arrays use pointers between elements

2. Which of the following is the correct way to access the 3rd element in an array named arr?

easy

A. arr[3]

B. arr(3)

C. arr[2]

D. arr->3

Solution

1. Step 1: Recall zero-based indexing in arrays

   Arrays start counting from 0, so the first element is arr[0], second arr[1], third arr[2].

2. Step 2: Identify correct syntax

   Using square brackets with index 2 accesses the third element correctly.

3. Final Answer:

   arr[2] -> Option C

4. Quick Check:

   Third element index = 2 [OK]

Hint: Array indexing starts at zero, so third element is index 2 [OK]

Common Mistakes:

• Using parentheses instead of brackets
• Using index 3 for third element
• Using pointer syntax incorrectly

3. Consider this code snippet using a linked list:

node1 = Node(10)
node2 = Node(20)
node1.next = node2
print(node1.next.data)

What will be the output?

medium

A. 20

B. node2

C. 10

D. Error

Solution

1. Step 1: Understand node linking

   node1.next points to node2, which holds data 20.

2. Step 2: Access data through next pointer

   node1.next.data accesses node2's data, which is 20.

3. Final Answer:

   20 -> Option A

4. Quick Check:

   node1.next.data = 20 [OK]

Hint: Follow the next pointer to get linked node's data [OK]

Common Mistakes:

• Printing node1.data instead of node1.next.data
• Confusing node reference with data value
• Expecting error due to missing initialization

4. What is wrong with this code snippet for inserting a new node at the start of a linked list?

new_node = Node(5)
new_node.next = head
head = new_node.next

medium

A. head should be assigned to new_node, not new_node.next

B. new_node.next should be null before assignment

C. Node creation syntax is incorrect

D. No error, code is correct

Solution

1. Step 1: Analyze pointer assignments

   new_node.next is set to head, which is correct to link new node to list.

2. Step 2: Check head update

   head should point to new_node to update list start, but code assigns head = new_node.next, losing new_node.

3. Final Answer:

   head should be assigned to new_node, not new_node.next -> Option A

4. Quick Check:

   Head must point to new node [OK]

Hint: Head must point to new node after insertion [OK]

Common Mistakes:

• Assigning head to new_node.next instead of new_node
• Not linking new_node.next to old head
• Confusing node creation with pointer assignment

5. You need to frequently add and remove elements from the middle of a collection. Which data structure is better and why?

hard

A. Array, because it allows fast random access

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

C. Array, because it uses less memory

D. Linked list, because it stores elements in continuous memory

Solution

1. Step 1: Consider insertion and deletion costs

   Arrays require shifting elements when inserting or deleting in the middle, which is slow.

2. Step 2: Understand linked list flexibility

   Linked lists use pointers to connect nodes, so insertion and deletion in the middle is fast without shifting.

3. Final Answer:

   Linked list, because it allows easy insertion and deletion without shifting elements -> Option B

4. Quick Check:

   Frequent middle changes = Linked list [OK]

Hint: Use linked list for easy middle insert/delete [OK]

Common Mistakes:

• Choosing array for middle insert/delete ignoring shift cost
• Thinking linked list stores data continuously
• Assuming arrays always use less memory