minimumAverage: easy O(nlogn) solution. BEAT 100%. ✅
IntuitionThe problem requires calculating the minimum average of pairs of elements. Sorting the list seems like a good starting point to facilitate this process
# Intuition
The problem requires calculating the minimum average of pairs of elements. Sorting the list seems like a good starting point to facilitate this process.

# Approach
First, sort the list of numbers. Then, find the length of the list and calculate the average of pairs of numbers starting from the first and last elements, moving towards the center. Keep track of the minimum average found during this process.

# Complexity
- Time complexity:
O(nlogn)

- Space complexity:
O(1)

# Code
```python3 []
class Solution:
    def minimumAverage(self, nums: List[int]) -> float:
        nums.sort()
        length=len(nums)-1
        n=len(nums)//2
        Min=50
        for i in range(n):
            mean=(nums[i]+nums[length-i])/2
            if mean<Min: Min=mean
        return Min
```
['Array', 'Two Pointers', 'Sorting', 'Python3']