easy to understand
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- O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n- O(n)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    double minimumAverage(vector<int>& nums) {\n//frist we sort the array\n        sort(nums.begin(),nums.end());\n        int s=0;\n        int e=nums.size()-1;\n        vector<long double> ans;\n//then minElement + maxEle avrg\n        while(s<e){\n             long double add=nums[s] + nums[e];\n            add/=2.0;\n            ans.push_back(add);\n            s++;\n            e--;\n\n        }\n       \n//then among of all avrg we are find the minimum avrg\n     long double min=ans[0];\n    for(int i=0;i<ans.size();i++){\n        cout<<"->"<<ans[i]<<endl;\n        if(min>ans[i]){\n            min=ans[i];\n        }\n    }\n\n    return min;\n\n        \n    }\n};\n```
['C++']