Two Pointer
IntuitionApproachComplexity
Time complexity:

Space complexity:
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)$$ -->

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

# Code
```cpp []
class Solution {
public:
    double minimumAverage(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<double> ave;
        int l=0,r=nums.size()-1;
        while(l<r){
            double result = 0;
            result = (nums[l] + nums[r]) / 2.0;
            ave.push_back(result);
            l++;
            r--;
        }
        double ans = *min_element(ave.begin(), ave.end());
        return ans;
    }
};
```
['C++']