palindromes

// Nikolai Matev
// Task: Print all palindromic primes from given array

//function that checks if a string is palindromic
function isPalindrome(str) {
    var len = str.length;

    var mid = Math.floor(len/2);

    for ( var i = 0; i < mid; i++ ) {
        if (str[i] !== str[len - 1 - i]) {
            return false;
        }
    }
    return true;
}

//function that checks if a num is prime
function isPrime(num) {
  for(var i = 2; i < num; i++)
    if(num % i === 0) return false;
  return num > 1;
}

//Print all palindromic primes from given array
function printPalPrimesinArr(arrNums)
{
  var arrResult = []

  arrNums.forEach(num => {
    if(isPalindrome(num.toString()) && isPrime(num))
      arrResult.push(num)
    });


  return arrResult;
}



// Check results
let n1 = [2, 4, 5, 6, 8, 9, 11, 12, 131, 132, 382, 383];
document.write('<p>Palindromic primes in array [ '+ n1 +' ] are :</p>');
document.write(printPalPrimesinArr(n1));

let n2 = [];
document.write('<p>Palindromic primes in array [ '+ n2 +' ] are :</p>');
document.write(printPalPrimesinArr(n2));