input: Write a function to move all zeroes in a given list to the end of the list while maintaining the relative order of the non-zero elements. If the list is empty, return an empty list.
  assert move_zeroes([3, 0, 1, 0, 5, 0, 2])==[3, 1, 5, 2, 0, 0, 0]
  assert move_zeroes([0, 0, 0, 1, 2, 3])==[1, 2, 3, 0, 0, 0]
  assert move_zeroes([1, 2, 3, 4])==[1, 2, 3, 4]
  assert move_zeroes([])==[]
output: def move_zeroes(nums):
      non_zeroes = [x for x in nums if x != 0]
      zeroes = [0] * (len(nums) - len(non_zeroes))
      return non_zeroes + zeroes