/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

4 votes102 views2 answers
How to get runtime of a function in python
Python
1 vote95 views1 answer
Addition/subtraction of integers and integer-arrays with DatetimeArray is no longer supported
Python
27 votes105 views3 answers
Pandas replce none with nan
Python
2 votes96 views4 answers
Python how to draw a circle
Python
10 votes112 views9 answers
Google traduction
Python
1 vote184 views1 answer
Sum values in django models
Python
1 vote122 views1 answer
Assert len(lex) < self.bucket_specs[-1][1]
Python
13 votes101 views5 answers
Finding the maximum value in a list python
Python
0 vote148 views1 answer
Linking custom CSS in flask
Python
0 vote92 views1 answer
Ejercicios con funciones en python
Python