 ✅100.00%🔥|| ✅Easy to understand 🔥|| Beginners friendly
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) {
        vector<double> ans;
        int n = nums.size();
        sort(nums.begin(), nums.end());
        for (int i = 0; i < n / 2; i++)
            ans.push_back((nums[i] + nums[(n - 1) - i]) / 2.0);
        sort(ans.begin(), ans.end());
        return ans[0];
    }
};
```
['Array', 'Sorting', 'C++']