easy sort + 2 pointer solution
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());
            int s=0,e=nums.size()-1;
            double res=10000;
        while(s<e){  
       double temp=(nums[s]+nums[e])/2.0;
       if(temp<res){
        res=temp;
       }
                  e--;
                  s++;

        }
        return res;
    }
};
```
['C++']