input: Write a function to sort numbers based on their divisibility by a given integer.
  assert sortByDivisible([10, 7, 3, 9, 12, 15], 3) == [9, 12, 3, 10, 7, 15]
  assert sortByDivisible([2, 4, 6, 8, 10], 2) == [2, 4, 6, 8, 10]
  assert sortByDivisible([1, 2, 3, 4, 5, 6], 1) == [1, 2, 3, 4, 5, 6]
output: def sortByDivisible(numbers, divisor):
      divisible = [num for num in numbers if num % divisor == 0]
      non_divisible = [num for num in numbers if num % divisor != 0]
      return divisible + non_divisible