Easy Video Solution 🔥 || How to 🤔 in Interview  || Sorting ✅ || 2 Pointers 🔥
If you like the solution Please Upvote and subscribe to my youtube channel\n\n# Intuition\n Describe your first thoughts on how to solve this problem. \nDry Run
***If you like the solution Please Upvote and subscribe to my youtube channel***\n\n# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nDry Run few examples and observe\n\n\n\n# ***Easy Video Explanation***\n\nhttps://youtu.be/EZTuSum-Mnw\n\n\n# Code\n```\nclass Solution {\npublic:\n    double minimumAverage(vector<int>& v) {\n        int n=v.size();\n        sort(v.begin(),v.end());\n        int i=0,j=n-1;\n        double ans=1000;\n        while(i<j) {\n            double k = (v[i]+v[j])/(2*1.0);\n            ans=min(ans,k);\n            i++;\n            j--;\n        }\n        return ans;\n    }\n};\n```
['Two Pointers', 'Sorting', 'C++']