/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

-3 votes308 views1 answer
Ascii python list
Python
0 vote307 views1 answer
Fake-useragent proxy webscraping browser change
Python
3 votes282 views2 answers
Run python notepad++
Python
0 vote315 views1 answer
Python cursor placement
Python
1 vote304 views1 answer
Django sort descending
Python
2 votes292 views1 answer
Groups the DataFrame using the specified columns
Python
0 vote303 views2 answers
Concatenate the squares of numbers in python
Python
0 vote280 views1 answer
Print numpy version
Python
75 votes275 views2 answers
Httpie on windows
Python
24 votes296 views1 answer
How to replace na values in python
Python