codewars算法題-求因子

算法要求

Create a function named divisors that takes an integer and returns an array with all of the integer’s divisors(except for 1 and the number itself). If the number is prime return the string ‘(integer) is prime’ (use Either String a in Haskell).
創建一個divisors函數，參數爲一個整數，返回該整數的除數（除了1和她本身），如果該整數是質數的話，返回返回一段字符串”(integer) is prime’”

function divisors(integer) {
  var i=2;
  var arr = [];
  for( ; i <= integer/2 ; i++){
    if(integer%i == 0 ){
      arr.push(i);
    }
  }
  if(arr.length == 0){
    return integer+" is prime";
  }else {
    return arr;
  }
};

當作記錄，不定期更新