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<!-- Add your time complexity here, e.g. $$O(n)$$ -->O(n)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\n    public double minimumAverage(int[] nums) {\n        Arrays.sort(nums);\n        int n=0;\n        int m=nums.length-1;\n        double min=Integer.MAX_VALUE;\n        while(n<m){\n            double avg=((double)nums[n]+(double)nums[m])/2;\n            if(min>avg){\n                min=avg;\n            }\n            n++;\n            m--;\n        }\n        return min;\n    }\n}\n```
['Java']