/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

7 votes188 views1 answer
Check key pressed pygame
Python
0 vote163 views1 answer
Python print exection type
Python
0 vote184 views1 answer
Python Multiline docstring example
Python
0 vote149 views1 answer
Django multiple search fields
Python
12 votes174 views6 answers
Pandas drop columns by index
Python
0 vote155 views1 answer
~coinbase api
Python
1 vote198 views1 answer
Django filter by date range
Python Django
0 vote189 views1 answer
Python tensorflow is not defined
Python
1 vote197 views2 answers
Make python use python3
Python
1 vote179 views1 answer
How to convert async function to sync function in python
Python