Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Binary Search solution in Clear category for Super Root by kameranis
import math
def super_root(number):
e = 0.0001
left = 1.0
right = 10.0
mid = (left+right)/2
curr = mid**mid
while math.fabs(curr - number) > e: # Binary search
curr = mid**mid
if curr > number:
right = mid
elif curr < number:
left = mid
else: # Not likely
return mid
mid = (left+right)/2
mid = (left+right)/2
return mid
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
def check_result(function, number):
result = function(number)
if not isinstance(result, (int, float)):
print("The result should be a float or an integer.")
return False
p = result ** result
if number - 0.001 < p < number + 0.001:
return True
return False
assert check_result(super_root, 4), "Square"
assert check_result(super_root, 9), "Cube"
assert check_result(super_root, 81), "Eighty one"
July 9, 2014
