input: Write a function to take a number as input and print all the divisors of the number. Return the list of divisors.
  assert divisors(12) == [1, 2, 3, 4, 6, 12]
  assert divisors(17) == [1, 17]
  assert divisors(1) == [1]
  assert divisors(0) == []
  assert divisors(-6) == [1, 2, 3, 6]
output: def divisors(n):
      if n == 0:
          return []
      if n < 0:
          n = -n
      result = []
      for i in range(1, n + 1):
          if n % i == 0:
              result.append(i)
      return result