input: Write a function find_divisors that takes a number and returns a list of all its divisors. If the number has no divisors, return an empty list.
  
  assert find_divisors(12) == [1, 2, 3, 4, 6, 12]
  assert find_divisors(7) == [1, 7]
  assert find_divisors(0) == []
  assert find_divisors(-12) == []
  assert find_divisors(25) == [1, 5, 25]
output: def find_divisors(number):
      if number <= 0:
          return []
      divisors = []
      for i in range(1, number + 1):
          if number % i == 0:
              divisors.append(i)
      return divisors