#include <stdio.h>
int calculate_sum(int *ptr, int n) {
// Your logic here
int i, sum=0, *p;
for (i=0, p=ptr; i < n; i++, p++) {
sum += *p;
}
return sum;
}
int main() {
int n;
scanf("%d", &n);
int arr[100];
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
int result = calculate_sum(arr, n);
printf("%d", result);
return 0;
}
Solving Approach
use a pointer to top of array, add elements to sum as you traverse down to end.