forked from AllAlgorithms/javascript
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsmallest-common-multiple.js
More file actions
32 lines (27 loc) · 935 Bytes
/
smallest-common-multiple.js
File metadata and controls
32 lines (27 loc) · 935 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
// Find the smallest common multiple of the given parameters that can be evenly divided by both, as well as
// by all numbers in the range between these parameters.
// The range is an array of two numbers, not necessarily be in numerical order.
function smallestCommons(arr) {
arr.sort(function(a, b) { //sorting given numbers
return b - a;
});
var num = [];
for (var i = arr[0]; i >= arr[1]; i--) { //create array of all nums
num.push(i);
}
var quot = 0; //variables for the quotient that can access them outside the loop
var loop = 1;
var n;
// Run code while n is not the same as the array length.
do {
quot = num[0] * loop * num[1];
for (n = 2; n < num.length; n++) {
if (quot % num[n] !== 0) {
break;
}
}
loop++;
} while (n !== num.length);
return quot;
}
smallestCommons([1,5]); //Example of given numbers