input: Write a python function that, given a list of integers, returns the list sorted in an unconventional order. This unusual sorting begins with the smallest value, followed by the largest value from the remaining numbers, then the next smallest, and so on.
  assert odd_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]
  assert odd_sort_list([5, 6, 7, 8, 9]) == [5, 9, 6, 8, 7]
  assert odd_sort_list([1, 2, 3, 4, 5]) == [1, 5, 2, 4, 3]
  assert odd_sort_list([5, 6, 7, 8, 9, 1]) == [1, 9, 5, 8, 6, 7]
  assert odd_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]
  assert odd_sort_list([]) == []
  assert odd_sort_list([1,2,3,4,5,6,7,8]) == [1, 8, 2, 7, 3, 6, 4, 5]
  assert odd_sort_list([0,2,2,2,5,5,-5,-5]) == [-5, 5, -5, 5, 0, 2, 2, 2]
  assert odd_sort_list([111111]) == [111111]
output: def odd_sort_list(lst):
      lst.sort()
      result = []
      while lst:
          result.append(lst.pop(0))
          if lst:
              result.append(lst.pop(-1))
      return result