input: Write a function to randomize a list of given integers using an optimized Fisher-Yates algorithm. The function should accept a list of integers and return the randomized list. If the input list is empty, the function should return an empty list.
  
  import random
  
  def randomized_list(num_list):
      for i in range(len(num_list)-1,0,-1):
          j = random.randint(0,i)
          num_list[i],num_list[j] = num_list[j],num_list[i]
      return num_list
  
  import random
  random.seed(0)
  
  assert randomized_list([1, 2, 3, 4, 5])==[1, 5, 2, 4, 3]
  assert randomized_list([10, 20, 30, 40, 50])==[30, 50, 10, 40, 20]
  assert randomized_list([])==[]
output: import random
  
  def randomized_list(num_list):
      for i in range(len(num_list)-1,0,-1):
          j = random.randint(0,i)
          num_list[i],num_list[j] = num_list[j],num_list[i]
      return num_list