input: Write a function to find all the divisors of a given number. The function should take an integer input and return a list of all its divisors. If the given number is 0, the function should return an empty list since 0 has no divisors.
  
  def find_divisors(num):
      if num == 0:
          return []
      divisors = []
      for i in range(1, num + 1):
          if num % i == 0:
              divisors.append(i)
      return divisors
  
  assert find_divisors(12) == [1, 2, 3, 4, 6, 12]
  assert find_divisors(0) == []
  assert find_divisors(7) == [1, 7]
  assert find_divisors(-1) == []
  assert find_divisors(25) == [1, 5, 25]
output: def find_divisors(num):
      if num == 0:
          return []
      divisors = []
      for i in range(1, abs(num) + 1):
          if num % i == 0:
              divisors.append(i)
      return divisors