easiest way 
Complexity
Time complexity: O(N2)

Space complexity: O(1)
Code


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

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

# Code
```python3 []
class Solution:
    def minimumAverage(self, nums: List[int]) -> float:
        avgrage = []
        for i in range(len(nums)//2):
            avgrage.append((min(nums)+max(nums))/2)
            nums.remove(min(nums))
            nums.remove(max(nums))
        return min(avgrage)
        
```
['Python3']