[javascript]判断素数的无优化函数

.

'use strict';function get_primes(arr) {var s = [];for(let i = 0; i < arr.length; i++){let temp = 0;for(let j = 1; j <= (arr[i]/2); j++){for(let k = arr[i]; k >= 1; k--){if(j * k == arr[i]){temp++;}}}if(temp == 1){s.push(arr[i]);}}    return s;}// 测试:var x, r, arr = [];for (x = 1; x < 100; x++) {    arr.push(x);}r = get_primes(arr);if (r.toString() === [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97].toString()) {    alert('测试通过!');} else {    alert('测试失败: ' + r.toString());}