Minimum Average of Smallest and Largest Elements
IntuitionApproachComplexity
Time complexity:
O(n)
Space complexity:
O(n)Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
O(n)

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
O(n)

# Code
```cpp []
class Solution {
public:
    double minimumAverage(vector<int>& nums) {
        vector<double>average;
        int n=nums.size();
        sort(nums.begin(),nums.end());
        for(int i=0;i<n/2;i++)
        {
            average.push_back((nums[i]+nums[n-i-1])/2.0);
        }
        return *min_element(average.begin(),average.end());
    }
};
```
['C++']