def efficientalgo(number, x): print("Start with this number... " + str(number)) # See if a number is dividable by three, if so then divide by 3 if number % 3 == 0: print("Dividing three...") number /= 3 print(number) # use recursion to see if the number can be divided again number += efficientalgo(number, x) #print("Returning number from division by three now...") #return number # Divide a number by 2 if it is evenly dividable by 2 if number % 2 == 0: print("Dividing two...") number /= 2 print(number) # Use recursion to see if the number can be divided again number += efficientalgo(number, x) #print("Returning number from division by two now...") #print(number) #return number # If a number is not one, then subtract one and call the if number != 1: print("Subtracting one now...") number -= 1 print(number) # Use recursion to see if the number can be divided again number += efficientalgo(number, x) #print(number) #return number # If the number is one, return it and finish. if number == 1: print("Returning one now... " + str(number)) return number print(efficientalgo(1000, 1))
Run
Reset
Share
Import
Link
Embed
Language▼
English
中文
Python Fiddle
Python Cloud IDE
Follow @python_fiddle
Browser Version Not Supported
Due to Python Fiddle's reliance on advanced JavaScript techniques, older browsers might have problems running it correctly. Please download the latest version of your favourite browser.
Chrome 10+
Firefox 4+
Safari 5+
IE 10+
Let me try anyway!
url:
Go
Python Snippet
Stackoverflow Question