0 ms beats 100%, NLog(N) Time Complexity 
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def minimumAverage(self, nums: List[int]) -> float:
        nums.sort()

        l = 0
        r = len(nums) - 1
        minAvg = float('inf')
        while l < r:
            avg = (nums[l] + nums[r])/2

            minAvg = min(minAvg,avg)
            l+=1
            r-=1
        
        return minAvg

```
['Array', 'Two Pointers', 'Sorting', 'Python3']