Array Reversal Techniques in DSA Python - Time & Space Complexity

Time Complexity: Array Reversal Techniques

O(n)

Understanding Time Complexity

We want to understand how the time needed to reverse an array changes as the array gets bigger.

How does the number of steps grow when we reverse more elements?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def reverse_array(arr):
    start = 0
    end = len(arr) - 1
    while start < end:
        arr[start], arr[end] = arr[end], arr[start]
        start += 1
        end -= 1

This code reverses the elements of an array by swapping pairs from the ends moving towards the center.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Swapping two elements in the array.
• How many times: About half the length of the array (n/2 times).

How Execution Grows With Input

As the array size grows, the number of swaps grows roughly half as fast.

Input Size (n)	Approx. Operations (Swaps)
10	5
100	50
1000	500

Pattern observation: The operations grow linearly with input size, just half as many swaps as elements.

Final Time Complexity

Time Complexity: O(n)

This means the time to reverse the array grows directly in proportion to the number of elements.

Common Mistake

[X] Wrong: "Reversing an array takes constant time because we just swap pairs."

[OK] Correct: Even though each swap is quick, the number of swaps grows with the array size, so total time grows too.

Interview Connect

Understanding how array reversal scales helps you reason about loops and data manipulation, a key skill in many coding challenges.

Self-Check

"What if we used recursion to reverse the array instead of a loop? How would the time complexity change?"

Practice

1. What does reversing an array mean in simple terms?

easy

A. Sorting the array in ascending order

B. Changing the order of elements so the last becomes first and first becomes last

C. Removing duplicate elements from the array

D. Adding new elements to the end of the array

Solution

1. Step 1: Understand the meaning of reversal

   Reversing means flipping the order of elements so the last element comes first and the first element comes last.

2. Step 2: Compare with other options

   Sorting arranges elements by value, removing duplicates deletes repeats, and adding elements is insertion, not reversal.

3. Final Answer:

   Changing the order of elements so the last becomes first and first becomes last -> Option B

4. Quick Check:

   Reversal = Flip order [OK]

Hint: Reversal flips order, not sorts or removes [OK]

Common Mistakes:

• Confusing reversal with sorting
• Thinking reversal removes duplicates
• Mixing reversal with adding elements

2. Which of the following is the correct Python syntax to reverse a list named arr in-place?

easy

A. arr = arr.reverse()

B. reverse(arr)

C. arr.reverse()

D. arr[::-1]

Solution

1. Step 1: Identify the in-place reversal method

   In Python, arr.reverse() reverses the list in-place and returns None.

2. Step 2: Check other options

   reverse(arr) is not a valid function, arr = arr.reverse() assigns None to arr, and arr[::-1] creates a reversed copy but does not change arr in-place.

3. Final Answer:

   arr.reverse() -> Option C

4. Quick Check:

   In-place reverse uses arr.reverse() [OK]

Hint: Use arr.reverse() for in-place reversal [OK]

Common Mistakes:

• Assigning arr = arr.reverse() which sets arr to None
• Using slicing without assignment for in-place change
• Calling a non-existent reverse() function

3. What is the output of the following code?

arr = [1, 2, 3, 4, 5]
reversed_arr = arr[::-1]
print(reversed_arr)
print(arr)

medium

A. [5, 4, 3, 2, 1] and [1, 2, 3, 4, 5]

B. [5, 4, 3, 2, 1] and [5, 4, 3, 2, 1]

C. [1, 2, 3, 4, 5] and [1, 2, 3, 4, 5]

D. Error because slicing cannot reverse

Solution

1. Step 1: Understand slicing with negative step

   The slice arr[::-1] creates a new list with elements in reverse order.

2. Step 2: Check original list after slicing

   The original list arr remains unchanged because slicing returns a new list.

3. Final Answer:

   [5, 4, 3, 2, 1] and [1, 2, 3, 4, 5] -> Option A

4. Quick Check:

   Slicing reverses copy, original unchanged [OK]

Hint: Slicing with [::-1] reverses copy, not original [OK]

Common Mistakes:

• Thinking slicing changes original list
• Expecting error from slicing
• Confusing reversed copy with in-place change

4. Find the error in this code that tries to reverse a list arr in-place:

def reverse_list(arr):
    for i in range(len(arr)):
        arr[i], arr[len(arr)-i] = arr[len(arr)-i], arr[i]

arr = [1, 2, 3, 4]
reverse_list(arr)
print(arr)

medium

A. Syntax error in the for loop

B. No error, code works correctly

C. arr is not modified because function returns nothing

D. Index out of range error due to incorrect index calculation

Solution

1. Step 1: Analyze index usage in swapping

   The code uses arr[len(arr)-i] which causes index out of range because list indices go from 0 to len(arr)-1.

2. Step 2: Identify correct index for swapping

   The correct index should be len(arr)-1 - i to avoid going beyond the last index.

3. Final Answer:

   Index out of range error due to incorrect index calculation -> Option D

4. Quick Check:

   Index error from len(arr)-i used as index [OK]

Hint: Use len(arr)-1 - i for last index, not len(arr)-i [OK]

Common Mistakes:

• Using len(arr)-i instead of len(arr)-1 - i
• Not realizing list indices start at 0
• Assuming function returns reversed list

5. You have a list of numbers arr = [10, 20, 30, 40, 50]. Write a function that reverses the list without using built-in reverse methods or slicing. Which approach below correctly reverses the list in-place?

hard

A. Swap elements from start and end moving towards center using a while loop

B. Create a new list and append elements from the original list in reverse order

C. Sort the list in descending order

D. Use a for loop to assign arr[i] = arr[len(arr)-1-i] without swapping

Solution

1. Step 1: Understand in-place reversal without built-ins

   Swapping elements from start and end moving towards the center changes the list in-place without extra space.

2. Step 2: Evaluate other options

   Creating a new list is not in-place, sorting changes order by value, and assigning without swapping overwrites data incorrectly.

3. Final Answer:

   Swap elements from start and end moving towards center using a while loop -> Option A

4. Quick Check:

   In-place reversal = swap ends towards center [OK]

Hint: Swap pairs from ends moving inward for in-place reverse [OK]

Common Mistakes:

• Using sorting instead of reversal
• Overwriting elements without swapping
• Creating new list instead of in-place change