/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

1 vote264 views1 answer
How to check any script is running in background linux using python
Python
16 votes287 views3 answers
How to code music in python
Python
0 vote284 views2 answers
Problem 1 dot product python
Python
19 votes279 views6 answers
.pop python
Python
0 vote284 views1 answer
A way to extract from a DateTime value data without seconds
Python
0 vote282 views2 answers
Python - create frequency table between two columns
Python
19 votes289 views2 answers
Learn python 3
Python
0 vote291 views1 answer
Print without parenthesis
Python
0 vote265 views2 answers
Adding objects to existing legend
Python
13 votes281 views5 answers
How to check if an input is a number in python
Python