Array Reversal Techniques in DSA Python - Execution Trace

Concept Flow - Array Reversal Techniques

Start with array

↓

Set left = 0, right = len-1

↓

Check if left < right?

No→Done

Yes↓

Swap elements at left and right

↓

Increment left, Decrement right

↩Back to check left < right

We start with two pointers at the ends of the array and swap elements moving inward until they meet.

Execution Sample

DSA Python

arr = [1, 2, 3, 4, 5]
left, right = 0, len(arr)-1
while left < right:
    arr[left], arr[right] = arr[right], arr[left]
    left += 1
    right -= 1
print(arr)

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

Execution Table

Step	Operation	left	right	Array State	Pointer Changes
1	Initialize pointers	0	4	[1, 2, 3, 4, 5]	left=0, right=4
2	Check left < right	0	4	[1, 2, 3, 4, 5]	0 < 4 is True
3	Swap arr[left] and arr[right]	0	4	[5, 2, 3, 4, 1]	Swap arr[0] and arr[4]
4	Increment left, Decrement right	1	3	[5, 2, 3, 4, 1]	left=1, right=3
5	Check left < right	1	3	[5, 2, 3, 4, 1]	1 < 3 is True
6	Swap arr[left] and arr[right]	1	3	[5, 4, 3, 2, 1]	Swap arr[1] and arr[3]
7	Increment left, Decrement right	2	2	[5, 4, 3, 2, 1]	left=2, right=2
8	Check left < right	2	2	[5, 4, 3, 2, 1]	2 < 2 is False
9	End loop	2	2	[5, 4, 3, 2, 1]	Reversal complete

💡 left is not less than right (2 < 2 is False), so loop ends

Variable Tracker

Variable	Start	After Step 4	After Step 7	After Step 9 (Final)
left	0	1	2	2
right	4	3	2	2
arr	[1, 2, 3, 4, 5]	[5, 2, 3, 4, 1]	[5, 4, 3, 2, 1]	[5, 4, 3, 2, 1]

Key Moments - 3 Insights

Why do we stop when left is not less than right?

Because when left meets or passes right, all elements have been swapped. See execution_table rows 8 and 9 where 2 < 2 is False, so we stop.

Why do we swap arr[left] and arr[right] instead of just moving pointers?

Swapping arr[left] and arr[right] reverses the elements at the ends. Without swapping, the array stays the same. See rows 3 and 6 where swaps change the array.

What happens if the array has an odd number of elements?

The middle element stays in place because left and right meet at the center. See row 7 where left and right both become 2, the middle index.

Visual Quiz - 3 Questions

Look at the execution_table at Step 3, what is the array state after the swap?

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

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

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

D [1, 4, 3, 2, 5]

💡 Hint

Check the 'Array State' column at Step 3 in execution_table.

At which step does the condition left < right become false?

A Step 6

B Step 4

C Step 8

D Step 2

💡 Hint

Look at the 'Pointer Changes' and 'Operation' columns in execution_table for the condition check.

If the array length was even, how would the final left and right pointers compare?

A left would be equal to right

B left would be greater than right

C left would be less than right

D left and right would not change

💡 Hint

Refer to variable_tracker and think about how pointers move inward during swaps.

Concept Snapshot

Array Reversal Technique:
- Use two pointers: left at start, right at end
- While left < right:
  - Swap arr[left] and arr[right]
  - Move left forward, right backward
- Stop when pointers meet or cross
- Works for arrays of any length

Full Transcript

This visual execution shows how to reverse an array by swapping elements from the ends moving inward. We start with two pointers, left at 0 and right at the last index. While left is less than right, we swap the elements at these positions, then move left forward and right backward. When left meets or passes right, the array is reversed. The example uses the array [1, 2, 3, 4, 5] and shows each swap and pointer movement step by step, ending with the reversed array [5, 4, 3, 2, 1].

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