sforman
/
Thun
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Just for me... 

(That's how you look all clever, but it's a dick move removing the
commentary like that.)
This commit is contained in:
Simon Forman 2022-10-06 15:36:16 -07:00
parent e085218490
commit bad1a909c7
1 changed files with 2 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
bigjoyints/lil_divmod.py
View File

@ -22,27 +22,13 @@ def find_greatest(low, high, f):
for which f(n) and not f(n+1) is True. for which f(n) and not f(n+1) is True.
The greatest n which makes f(n) True. The greatest n which makes f(n) True.
''' '''
assert low <= high assert low <= high
# Maybe the high number is already the one?
if f(high): if f(high):
return high return high
# No such luck, let's pick a number between low and high
pivot = (low + high) >> 1 pivot = (low + high) >> 1
#print(low, pivot, high)
# If there isn't any such number in between low and high,
# that means there's only two numbers it could be: low or high
# and we already know it isn't high from the test above
# so it must be low.
if low == pivot:
assert f(low) and not f(low + 1)
return low
assert low < pivot < high
return ( return (
low
if low == pivot else
find_greatest(pivot, high - 1, f) find_greatest(pivot, high - 1, f)
if f(pivot) else if f(pivot) else
find_greatest(low, pivot - 1, f) find_greatest(low, pivot - 1, f)