✨ Simple solution || Python
Complexity
Time complexity: O(n log n)

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

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

# Code
```python []
class Solution(object):
    def minimumAverage(self, nums):
        """
        :type nums: List[int]
        :rtype: float
        """
        nums.sort()
        averages = []
        while len(nums) > 0:
            averages.append((nums[0] + nums[-1]) / float(2))
            nums.pop(0)
            nums.pop(-1)
        return min(averages)
        
```
['Python']