what is the short cut way to find the max and min element in an array in c++

To find the maximum and minimum elements in an array in C++, you can use the min_element and max_element functions provided by the <algorithm> library. Here's how you can do it:

1. Include the <algorithm> library at the beginning of your code:
   cpp #include <algorithm>

2. Declare and initialize your array: cpp int arr[] = {1, 5, 3, 7, 2}; int size = sizeof(arr) / sizeof(arr[0]);

3. Use the min_element and max_element functions to find the minimum and maximum elements in the array: cpp auto minElement = std::min_element(arr, arr + size); auto maxElement = std::max_element(arr, arr + size);

4. Access the values of the minimum and maximum elements: cpp int minValue = *minElement; int maxValue = *maxElement;

The min_element function returns an iterator pointing to the minimum element in the range [first, last), while the max_element function returns an iterator pointing to the maximum element in the range. By dereferencing these iterators, you can obtain the actual values of the minimum and maximum elements.

Note that min_element and max_element return the first occurrence of the minimum and maximum elements, respectively, in case there are multiple occurrences of the same value in the array.

Here's the complete code:

#include <algorithm>

int main() {
    int arr[] = {1, 5, 3, 7, 2};
    int size = sizeof(arr) / sizeof(arr[0]);

    auto minElement = std::min_element(arr, arr + size);
    auto maxElement = std::max_element(arr, arr + size);

    int minValue = *minElement;
    int maxValue = *maxElement;

    return 0;
}

This code will find the minimum element 1 and the maximum element 7 in the given array.