Best Easy Approach 😍🔥✅ Detailed Explanation
\n\n# Code\n\nclass Solution {\n    public double minimumAverage(int[] nums) {\n        Arrays.sort(nums);\n        int i=0,j=nums.length-1;\n        double min
\n\n# Code\n```\nclass Solution {\n    public double minimumAverage(int[] nums) {\n        Arrays.sort(nums);\n        int i=0,j=nums.length-1;\n        double min=nums[j];\n        while(i<nums.length/2){\n            double sum = (nums[i]+nums[j])/2.0;\n            if(min>sum){\n                min = sum;\n            }\n            i++;j--;\n        }\n        return min;\n    }\n}\n```
['Array', 'Two Pointers', 'Sorting', 'Java']