#include <stdio.h> int find_max_element(int *ptr, int n) { // Your logic here int counter = 0; int number = *(ptr + counter); while(counter < n-1) { if(number < *(ptr + counter + 1)) { number = *(ptr + counter + 1); //printf("%d \n",number); } counter++; } return number; } 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; }
Test Cases
Test Results
Input
5 10 25 5 30 15
Expected Output
30