input: from typing import List
  
  def find_min_average(nums: List[int]) -> float:
      """
      Consider an initially empty array of floating point numbers 'averages'. You have an array 'nums'
      consisting of 'n' integers, where 'n' is guaranteed to be even.
  
      Perform the following steps n / 2 times:
  
      - Select and remove the smallest element 'minElement' and the largest element 'maxElement' from 'nums'.
      - Add the result of (minElement + maxElement) / 2 to 'averages'.
      - Return the smallest value in 'averages'.
  
      Examples:
      >>> nums = [7,8,3,4,15,13,4,1]
      5.5
      >>> nums = [1,9,8,3,10,5]
      5.5
  
      Constraints:
      2 <= n == len(nums) <= 50
      n is even.
      1 <= nums[i] <= 50
      """
output:     nums.sort()
      averages = []
      while nums:
          minElement = nums.pop(0)
          maxElement = nums.pop(-1)
          averages.append((minElement + maxElement) / 2)
      return min(averages)