input: Write a function to implement the Fisher-Yates algorithm to generate a random permutation of numbers from 0 to n-1.
  assert len(fisher_yates(5)) == 5
  assert sorted(fisher_yates(10)) == list(range(10))
  assert sorted(fisher_yates(0)) == []
output: import random
  
  def fisher_yates(n):
      arr = list(range(n))
      for i in range(n-1, 0, -1):
          j = random.randint(0, i)
          arr[i], arr[j] = arr[j], arr[i]
      return arr