input: Write a function to design a Python program to randomize a list of given integers using an optimized Fisher-Yates algorithm. If the input list is empty, return an empty list.
  assert randomized_list([1, 2, 3, 4, 5])!= [1, 2, 3, 4, 5]
  assert randomized_list(['a', 'b', 'c', 'd'])!= ['a', 'b', 'c', 'd']
  assert randomized_list([])==[]
output: def randomized_list(lst):
      import random
      for i in range(len(lst) - 1, 0, -1):
          j = random.randint(0, i)
          lst[i], lst[j] = lst[j], lst[i]
      return lst