JAVA || 2ms
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 {\n    public double minimumAverage(int[] nums) {\n        Arrays.sort(nums);\n        double sum = (nums[0]+nums[nums.length-1])/2.0;\n        for(int i=1,j=nums.length-2;i<j;i++,j--){\n            double avg= (nums[i]+nums[j])/2.0;\n            if(sum>avg){\n                sum = avg;\n            }\n            \n        }\n        return sum;\n    }\n}\n```
['Java']