aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

September Morn Update

Browse source
This commit is contained in:
Ingy döt Net 2019-09-12 10:33:56 -07:00
parent 4e2d22a71d
commit aac6731f2c
6856 changed files with 141342 additions and 21127 deletions
Download patch file Download diff file Expand all files Collapse all files

75
Task/Prime-decomposition/JavaScript/prime-decomposition-2.js
View file

@ -1,41 +1,40 @@
function run_factorize(n) {
if (n <= 3)
return [n];
if (n <= 3)
return [n];
var ans = [];
var done = false;
while (!done)
{
if (n%2 === 0){
ans.push(2);
n /= 2;
continue;
}
if (n%3 === 0){
ans.push(3);
n /= 3;
continue;
}
if ( n === 1)
return ans;
var sr = Math.sqrt(n);
done = true;
// try to divide the checked number by all numbers till its square root.
for (var i=6; i<=sr; i+=6){
if (n%(i-1) === 0){ // is n divisible by i-1?
ans.push( (i-1) );
n /= (i-1);
done = false;
break;
}
if (n%(i+1) === 0){ // is n divisible by i+1?
ans.push( (i+1) );
n /= (i+1);
done = false;
break;
}
}
}
ans.push( n );
return ans;
var ans = [];
var done = false;
while (!done) {
if (n % 2 === 0) {
ans.push(2);
n /= 2;
continue;
}
if (n % 3 === 0) {
ans.push(3);
n /= 3;
continue;
}
if (n === 1)
return ans;
var sr = Math.sqrt(n);
done = true;
// try to divide the checked number by all numbers till its square root.
for (var i = 6; i <= (sr + 6); i += 6) {
if (n % (i - 1) === 0) { // is n divisible by i-1?
ans.push((i - 1));
n /= (i - 1);
done = false;
break;
}
if (n % (i + 1) === 0) { // is n divisible by i+1?
ans.push((i + 1));
n /= (i + 1);
done = false;
break;
}
}
}
ans.push(n);
return ans;
}