Как переставить местами самый маленький и самый большой элементы массива?

#include <iostream>
#include <algorithm>
#include <iterator>
int main()
{
    const unsigned int ARR_SIZE = 10;
 
    int arr[ARR_SIZE] = { 9, 4, 8, 8, 2, 1, 4, 5, 7, 3 };
 
    for ( unsigned int i = 0; i < ARR_SIZE; ++i )
        std::cout << arr[i] << " ";
    std::cout << "\n\n";
 
    int * max_elem = std::max_element( std::begin(arr), std::end(arr) );
    int * min_elem = std::min_element( std::begin(arr), std::end(arr) );
 
    unsigned int index_of_max = std::distance( std::begin(arr), max_elem );
    unsigned int index_of_min = std::distance( std::begin(arr), min_elem );
 
    std::swap( arr[index_of_min], arr[index_of_max] );
 
    for ( unsigned int i = 0; i < ARR_SIZE; ++i )
        std::cout << arr[i] << " ";
    std::cout << "\n\n";
}

#include <iostream>
#include <algorithm>
#include <iterator>
 
template <class T>
void show( const T & arr )
{
    for ( const auto & elem : arr )
        std::cout << elem << " ";
    std::cout << "\n\n";
}
 
int main()
{
    int arr[] = { 9, 4, 8, 8, 2, 1, 4, 5, 7, 3 };
 
    show( arr );
 
    int * max_elem = std::max_element( std::begin(arr), std::end(arr) );
    int * min_elem = std::min_element( std::begin(arr), std::end(arr) );
 
    unsigned int index_of_max = std::distance( std::begin(arr), max_elem );
    unsigned int index_of_min = std::distance( std::begin(arr), min_elem );
 
    std::swap( arr[index_of_min], arr[index_of_max] );
 
    show( arr );
}