First Try
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
```java []
class Solution {
    public double minimumAverage(int[] nums) {
        LinkedList<Integer> l1 = new LinkedList<>();
        for (int num : nums) {
            l1.add(num);
        }
        LinkedList <Double> l2=new LinkedList<>();
       
        while(!l1.isEmpty()){
            int i=Collections.max(l1);
            int j=Collections.min(l1);
            l1.remove(l1.indexOf(i));
            l1.remove(l1.indexOf(j));
            l2.add((double)(i+j)/2);
           
            }
            System.out.println();
        return  Collections.min(l2);
    }
}
```
['Java']