Easy C++ Solution || sort
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    double minimumAverage(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        double mini=INT_MAX;\n        int n=nums.size();\n        int l=0,r=n-1;\n        while(l<r)\n        {\n            double avg=((double)nums[l]+(double)nums[r])/2;\n            mini=min(mini,avg);\n            l++;\n            r--;\n        }\n        return mini;\n\n    }\n};\n```
['C++']