数据结构与算法三(js 实现质数算法)

<!DOCTYPE html>
<html lang="en">
<head>
    <meta charset="UTF-8">
    <title>质数算法</title>
</head>
<body>
<script>
    function isPrimeNumber(num){
        var sqrt = parseInt(Math.sqrt(num))/**开平方根*/
        for(var i = 2; i<= sqrt;i++){
            if (num %i == 0)return false;
        }
        return true;
    }

    alert(isPrimeNumber(3))
    alert(isPrimeNumber(10))
    alert(isPrimeNumber(13))
    alert(isPrimeNumber(30))
    alert(isPrimeNumber(41))

</script>


</body>
</html>

猜你喜欢

转载自blog.csdn.net/ZhaiAlan/article/details/92822197