#include<iostream>
#include<limits.h> //Get the minimum value
#include<algorithm> //max,min header file
int maxABS1(int* arr, int l){ //Array parameter transfer all the array name and size Pass in to avoid degenerate
int MAX = INT_MIN;
for(int i = 0; i < l; i++){ //boundary condition
MAX = std::max(arr[i], MAX); //need using namespace std
}
return MAX - std::min(arr[0], arr[l - 1]);
}
int main(){
int arr[]={2, 7, 3, 1, 1};
int ABS = maxABS(arr , sizeof(arr)/sizeof(int));
std::cout<<ABS <<std::endl;
return 0;
}
#include<limits.h> //Get the minimum value
#include<algorithm> //max,min header file
int maxABS1(int* arr, int l){ //Array parameter transfer all the array name and size Pass in to avoid degenerate
int MAX = INT_MIN;
for(int i = 0; i < l; i++){ //boundary condition
MAX = std::max(arr[i], MAX); //need using namespace std
}
return MAX - std::min(arr[0], arr[l - 1]);
}
int main(){
int arr[]={2, 7, 3, 1, 1};
int ABS = maxABS(arr , sizeof(arr)/sizeof(int));
std::cout<<ABS <<std::endl;
return 0;
}