Array Reversal Techniques in DSA C

Mental Model

Reversing an array means flipping its order so the last element becomes first and the first becomes last.

Analogy: Imagine a row of books on a shelf. Reversing the array is like taking the books from both ends and swapping them until you meet in the middle.

Index: 0   1   2   3   4
Array: [1] -> [2] -> [3] -> [4] -> [5]

Dry Run Walkthrough

Input: array: [1, 2, 3, 4, 5]

Goal: Reverse the array so it becomes [5, 4, 3, 2, 1]

Step 1: Swap first element (1) with last element (5)

[5] -> [2] -> [3] -> [4] -> [1]

Why: Swap ends to start reversing the order

Step 2: Swap second element (2) with second last element (4)

[5] -> [4] -> [3] -> [2] -> [1]

Why: Continue swapping inward to reverse the array

Step 3: Middle element (3) stays the same as it is the center

[5] -> [4] -> [3] -> [2] -> [1]

Why: No swap needed for middle element in odd length array

Result:

[5] -> [4] -> [3] -> [2] -> [1]

Annotated Code

DSA C

#include <stdio.h>

void reverseArray(int arr[], int n) {
    int start = 0;
    int end = n - 1;
    while (start < end) {
        // Swap elements at start and end
        int temp = arr[start];
        arr[start] = arr[end];
        arr[end] = temp;
        // Move pointers inward
        start++;
        end--;
    }
}

void printArray(int arr[], int n) {
    for (int i = 0; i < n; i++) {
        printf("%d", arr[i]);
        if (i < n - 1) printf(" -> ");
    }
    printf("\n");
}

int main() {
    int arr[] = {1, 2, 3, 4, 5};
    int n = sizeof(arr) / sizeof(arr[0]);
    printf("Original array:\n");
    printArray(arr, n);
    reverseArray(arr, n);
    printf("Reversed array:\n");
    printArray(arr, n);
    return 0;
}

while (start < end) {

loop until pointers meet or cross to cover all swaps

int temp = arr[start]; arr[start] = arr[end]; arr[end] = temp;

swap elements at start and end positions

start++; end--;

move pointers inward to next pair

Output

Original array:

1 -> 2 -> 3 -> 4 -> 5

Reversed array:

5 -> 4 -> 3 -> 2 -> 1

Complexity Analysis

Time: O(n) because each element is visited once during swapping

Space: O(1) because reversal is done in place without extra storage

vs Alternative: Compared to creating a new reversed array which uses O(n) extra space, this method is more space efficient

Edge Cases

empty array

function does nothing and array remains empty

DSA C

while (start < end) {

array with one element

no swaps occur, array stays the same

DSA C

while (start < end) {

array with even number of elements

all pairs swapped until pointers cross, full reversal achieved

DSA C

while (start < end) {

When to Use This Pattern

When you need to reverse the order of elements in a list or array efficiently, use the two-pointer swap technique to reverse in place.

Common Mistakes

Mistake: Swapping elements without moving pointers inward causing infinite loop
Fix: Increment start and decrement end pointers inside the loop after swapping

Mistake: Swapping elements incorrectly by overwriting without temporary variable
Fix: Use a temporary variable to hold one element during swap

Summary

Reverses the order of elements in an array by swapping pairs from ends inward.

Use when you want to reverse an array efficiently without extra space.

The key is swapping elements from start and end moving inward until they meet.

Practice

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

easy

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

B. Sorting the array in ascending order

C. Removing duplicate elements from the array

D. Adding new elements at the end of the array

Solution

1. Step 1: Understand array order

   An array has elements arranged from first to last index.

2. Step 2: Define reversal

   Reversing means swapping elements so the last element moves to the first position and vice versa.

3. Final Answer:

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

4. Quick Check:

   Reversal = Reverse order [OK]

Hint: Reversal flips the array order front to back [OK]

Common Mistakes:

• Confusing reversal with sorting
• Thinking reversal removes elements
• Assuming reversal adds elements

2. Which of the following C code snippets correctly swaps two elements arr[i] and arr[j] for array reversal?

easy

A. arr[i] = arr[j]; arr[j] = arr[i];

B. temp = arr[j]; arr[j] = arr[i]; arr[i] = temp;

C. int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp;

D. arr[i] = arr[j]; arr[j] = temp;

Solution

1. Step 1: Use a temporary variable for swapping

   To swap two values, store one in a temporary variable to avoid overwriting.

2. Step 2: Assign values correctly

   Assign arr[i] to temp, then arr[j] to arr[i], then temp to arr[j].

3. Final Answer:

   int temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; -> Option C

4. Quick Check:

   Swap uses temp variable [OK]

Hint: Always use a temp variable to swap two elements safely [OK]

Common Mistakes:

• Overwriting one element before saving it
• Using uninitialized temp variable
• Swapping without temp causes data loss

3. What is the output of the following C code?

int arr[] = {1, 2, 3, 4, 5};
int n = 5;
for(int i = 0; i < n/2; i++) {
  int temp = arr[i];
  arr[i] = arr[n - i - 1];
  arr[n - i - 1] = temp;
}
for(int i = 0; i < n; i++) {
  printf("%d ", arr[i]);
}

medium

A. 2 1 4 3 5

B. 5 4 3 2 1

C. 1 2 3 4 5

D. 5 3 2 4 1

Solution

1. Step 1: Understand the loop swaps

   The loop swaps elements from start and end moving towards the center: arr[0] with arr[4], arr[1] with arr[3].

2. Step 2: Trace swaps

   Swap 1 and 5 -> arr = {5, 2, 3, 4, 1}; Swap 2 and 4 -> arr = {5, 4, 3, 2, 1}; middle element 3 stays same.

3. Final Answer:

   5 4 3 2 1 -> Option B

4. Quick Check:

   Reversed array = 5 4 3 2 1 [OK]

Hint: Swapping pairs from ends reverses array [OK]

Common Mistakes:

• Not swapping all pairs correctly
• Loop running too many or too few times
• Confusing indices in swap

4. Identify the error in this C code snippet intended to reverse an array:

int arr[] = {10, 20, 30, 40};
int n = 4;
for(int i = 0; i <= n/2; i++) {
  int temp = arr[i];
  arr[i] = arr[n - i - 1];
  arr[n - i - 1] = temp;
}

medium

A. Temporary variable temp is not declared

B. The swap logic is incorrect

C. Array size n is wrong

D. The loop condition should be i < n/2 instead of i <= n/2

Solution

1. Step 1: Analyze loop condition

   The loop runs from i = 0 to i <= n/2, which means it runs one extra iteration when i = n/2.

2. Step 2: Understand effect of extra iteration

   For even n=4, n/2=2, so i=2 is invalid index for swapping (out of bounds or swaps middle element twice).

3. Final Answer:

   The loop condition should be i < n/2 instead of i <= n/2 -> Option D

4. Quick Check:

   Loop runs too far, fix condition [OK]

Hint: Use i < n/2 to avoid extra swap [OK]

Common Mistakes:

• Using <= causes out-of-bound swaps
• Confusing array length with index
• Ignoring zero-based indexing

5. Given an array arr of size n, which approach is best to reverse the array in-place with minimum extra memory and why?

hard

A. Use two pointers, one at start and one at end, swap and move towards center

B. Create a new array and copy elements from end to start

C. Use recursion to swap elements from ends

D. Sort the array in descending order

Solution

1. Step 1: Compare memory usage of methods

   Creating a new array uses extra memory equal to array size; recursion uses call stack memory.

2. Step 2: Evaluate two-pointer method

   Two pointers swap elements in-place without extra memory, making it efficient and simple.

3. Final Answer:

   Use two pointers, one at start and one at end, swap and move towards center -> Option A

4. Quick Check:

   Two-pointer swap = minimal memory [OK]

Hint: Two-pointer swap reverses in-place with no extra memory [OK]

Common Mistakes:

• Using extra arrays wastes memory
• Recursion adds unnecessary stack overhead
• Sorting does not reverse original order