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

Fixed a bug in getDivisors where a number could

Browse Source 
be added twice
This commit is contained in:
Mattrixwv
2019-03-22 17:50:24 -04:00
parent b87d4e1e52
commit 0e19945c84
1 changed files with 7 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
Algorithms.py
View File

@@ -1,7 +1,7 @@
#Python/myClasses/Algorithms.py #Python/myClasses/Algorithms.py
#Matthew Ellison #Matthew Ellison
# Created: 01-27-19 # Created: 01-27-19
#Modified: 02-09-19 #Modified: 03-22-19
#This is a file that contains a few algorithms that I have used several times #This is a file that contains a few algorithms that I have used several times
""" """
Copyright (C) 2019 Matthew Ellison Copyright (C) 2019 Matthew Ellison
@@ -150,13 +150,18 @@ def getDivisors(goalNumber: int) -> list:
#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
topPossibleDivisor = math.ceil(math.sqrt(goalNumber)) topPossibleDivisor = math.ceil(math.sqrt(goalNumber))
for possibleDivisor in range(2, topPossibleDivisor + 1): #Add one because we need <= goalNumber/2 possibleDivisor = 2
while(possibleDivisor <= topPossibleDivisor):
#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): if((goalNumber % possibleDivisor) == 0):
divisors.append(possibleDivisor) divisors.append(possibleDivisor)
#Account for the possibility sqrt(goalNumber) being a divisor #Account for the possibility sqrt(goalNumber) being a divisor
if(possibleDivisor != topPossibleDivisor): if(possibleDivisor != topPossibleDivisor):
divisors.append(goalNumber / possibleDivisor) divisors.append(goalNumber / possibleDivisor)
#Take care of a few occations where a number was added twice
if(divisors[len(divisors) - 1] == (possibleDivisor + 1)):
possibleDivisor += 1
possibleDivisor += 1
#Sort the list before returning for neatness #Sort the list before returning for neatness
divisors.sort() divisors.sort()