SIMPLE SORTING TWO-POINTER C++ SOLUTION
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:o(nlogn)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:o(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n\nclass Solution {\npublic:\n    double minimumAverage(std::vector<int>& nums) {\n        sort(nums.begin(), nums.end()); \n        int left = 0;\n        int right = nums.size() - 1;\n        double minAvg = INT_MAX;\n        while(left < right){\n            double avg = (nums[left] + nums[right]) / 2.0; \n            minAvg = min(minAvg, avg); \n            left++;  \n            right--; \n        }\n        return minAvg; \n    }\n};\n```
['C++']