igy95 / js-algorithm-practice Goto Github PK

for (let i = 1; i <= target; i++) {
  if (target % i === 0) {
    console.log(`${i}와 ${target / i}는 ${target}의 약수`);
  }
}

function isPrime(n) {
  if (n === 2) return true;
  if (n < 2 || n % 2 === 0) return false;

  for (let i = 3; i <= Math.sqrt(n); i += 2) {
    if (n % i === 0) return false;
  }

  return true;
}

const arr = [1, 2, 3, 4, 5];
const max = Math.max(...arr);

const 2dArray = new Array(5).fill().map(() => new Array(1).fill(0));
// [[0], [0], [0], [0], [0]]

function isPalindrome(str) {
  for (let i = 0; i < str.length / 2; i++) {
    if (str[i] !== str[str.length - i - 1]) return false;
  }

  return true;
}