Find Maximum Element Using Pointer Walk

Code

#include <stdio.h>

int find_max_element(int *ptr, int n) {
    // Your logic here
    int max_element = -2^31;
    int *ptr_left = ptr;
    int *ptr_right = ptr+n-1;
    while(ptr_left<=ptr_right)
    {
        if(*ptr_left > max_element)
        {
            if(*ptr_right > *ptr_left)
            {
                max_element = *ptr_right;
            }
            else
            {
                max_element = *ptr_left;
            }
        }
        ptr_left++;
        ptr_right--;
    }
    return max_element;
}

int main() {
    int n;
    scanf("%d", &n);

    int arr[100];
    for (int i = 0; i < n; i++) {
        scanf("%d", &arr[i]);
    }

    int result = find_max_element(arr, n);
    printf("%d", result);

    return 0;
}

Solving Approach