BaseLibraries/LuaClasses
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/luaclasses.git synced 2025-12-06 18:33:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

Fixed a bug in getDivisors where a number would be

Browse Source 
added twice
This commit is contained in:
Mattrixwv
2019-03-22 19:06:09 -04:00
parent a80644401f
commit b0ba590c53
1 changed files with 7 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
Algorithms.lua
View File

@@ -154,7 +154,8 @@ function getDivisors(goalNumber)
--Start at 3 and loop through all numbers < (goalNumber / 2) looking for a number that divides it evenly --Start at 3 and loop through all numbers < (goalNumber / 2) looking for a number that divides it evenly
local topPossibleDivisor = math.ceil(math.sqrt(goalNumber)); local topPossibleDivisor = math.ceil(math.sqrt(goalNumber));
for possibleDivisor=2,topPossibleDivisor do local possibleDivisor = 2;
while(possibleDivisor <= topPossibleDivisor) do
--If you find one add it and the number it creates to the list --If you find one add it and the number it creates to the list
if((goalNumber % possibleDivisor) == 0) then if((goalNumber % possibleDivisor) == 0) then
divisors[#divisors+1] = possibleDivisor; divisors[#divisors+1] = possibleDivisor;
@@ -162,7 +163,12 @@ function getDivisors(goalNumber)
if(possibleDivisor ~= topPossibleDivisor) then if(possibleDivisor ~= topPossibleDivisor) then
divisors[#divisors + 1] =(goalNumber / possibleDivisor); divisors[#divisors + 1] =(goalNumber / possibleDivisor);
end end
--Take care of a few occations where a number was added twice
if(divisors(#divisors) == (possibleDivisor + 1)) then
possibleDivisor = possibleDivisor + 1;
end
end end
possibleDivisor = possibleDivisor + 1;
end end
--Sort the list before returning for neatness --Sort the list before returning for neatness
table.sort(divisors); table.sort(divisors);