/Python/Factors of a number with memoization

Factors of a number with memoization

import math

def memoize(f):
    memo = {}
    def helper(x):
        if x not in memo:
            memo[x] = f(x)
        return memo[x]
    return helper

@memoize
def isprime (n):
    if n == 1:
        return False
    elif n == 2:
        return True
    else:
        for x in range (2, int(math.sqrt(n))+1):
            if n % x == 0:
                return False
                break
        else:
            return True


def factors (a):
    if a == 1:
        return []
    elif isprime(a):
        return [a]
    else:
        for x in range (2, int(math.sqrt(a))+1):
            if a % x == 0:
                return [x] + factors(a/x)

testnumber = int(input("Enter a number."))
print factors(testnumber)

Source: stackoverflow.com

Similar codes

0 vote132 views1 answer
Twitter api ("Connection broken: Invalid Chunk Length(got length b'', 0 bytes read)"
Python
0 vote126 views1 answer
Neutral
Python
0 vote122 views1 answer
Whta is "upvote":{"$numberInt":""} in python do
Python
0 vote126 views1 answer
How to make text bold in tkinter
Python
80 votes134 views6 answers
Sort dictionary by value python
Python
13 votes123 views1 answer
Selenium webdriver python
Python
0 vote144 views2 answers
Convert pdf folder to excell pandas
Python
0 vote140 views1 answer
Fibonacci series recursive python
Python
9 votes122 views6 answers
Np.random.choice
Python
2 votes113 views2 answers
How to make a latency command in discord py
Python