`assignment-s-13-2.c`¶

Problem Statement

Write a function that reverses the elements of an array in place, using only a single pointer argument, and return void.

Metadata¶

Property	Detail
Author	Amit Dutta amitdutta4255@gmail.com
Date	19 Dec 2025
License	MIT License (See the LICENSE file for details)
Difficulty	Intermediate (index: 5 / 10)

Concepts¶

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

Array
Pointers
Iteration
Sorting (possible)
Recursion

Actions¶

Raw View on GitHub

You can print or save this file by opening Raw and using your browser.

Source Code¶

#include <stdio.h>
#include <stdlib.h>

struct Array
{
    int size;
    int *arr;
};

void inputarr(int[], int);
void display(int[], int);
void reverse(struct Array *);

int main()
{
    struct Array array;
    printf("How many element do you want to add: ");
    scanf("%d", &array.size);
    array.arr = (int *)malloc((array.size) * sizeof(int));
    inputarr(array.arr, array.size);
    printf("\n=== Before Reverse ===\n");
    display(array.arr, array.size);
    reverse(&array);
    printf("\n\n=== After Reverse ===\n");
    display(array.arr, array.size);
    free(array.arr);
    return 0;
}

void inputarr(int arr[], int n)
{
    int i;
    for (i = 0; i < n; i++)
    {
        printf("Enter element %d: ", i + 1);
        scanf("%d", &arr[i]);
    }
}

void display(int arr[], int n)
{
    int i;
    for (i = 0; i < n; i++)
    {
        printf("\nIndex: %-2d | Value: %-5d | Address: %p", i, arr[i], (void *)&arr[i]);
    }
}

void reverse(struct Array *array)
{
    int *start = array->arr;
    int *end = array->arr + (array->size - 1);
    while (start < end)
    {
        *start = *start ^ *end;
        *end = *start ^ *end;
        *start = *start ^ *end;
        start++;
        end--;
    }
}

Explanation¶

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (assignment-s-13-2.c):

    #include <stdio.h>
    #include <stdlib.h>

    struct Array
    {
        int size;
        int *arr;
    };

    void inputarr(int[], int);
    void display(int[], int);
    void reverse(struct Array *);

    int main()
    {
        struct Array array;
        printf("How many element do you want to add: ");
        scanf("%d", &array.size);
        array.arr = (int *)malloc((array.size) * sizeof(int));
        inputarr(array.arr, array.size);
        printf("\n=== Before Reverse ===\n");
        display(array.arr, array.size);
        reverse(&array);
        printf("\n\n=== After Reverse ===\n");
        display(array.arr, array.size);
        free(array.arr);
        return 0;
    }

    void inputarr(int arr[], int n)
    {
        int i;
        for (i = 0; i < n; i++)
        {
            printf("Enter element %d: ", i + 1);
            scanf("%d", &arr[i]);
        }
    }

    void display(int arr[], int n)
    {
        int i;
        for (i = 0; i < n; i++)
        {
            printf("\nIndex: %-2d | Value: %-5d | Address: %p", i, arr[i], (void *)&arr[i]);
        }
    }

    void reverse(struct Array *array)
    {
        int *start = array->arr;
        int *end = array->arr + (array->size - 1);
        while (start < end)
        {
            *start = *start ^ *end;
            *end = *start ^ *end;
            *start = *start ^ *end;
            start++;
            end--;
        }
    }

assignment-s-13-2.c¶